Search
Now showing items 31-40 of 7654
A hybrid image restoration algorithm based on Projections onto Convex Sets and Harmony Search
(2013-09-09)
Image restoration is a research field that attempts to recover a blurred and noisy image. Since it can be modeled as a linear system, we propose in this paper to use the meta-heuristics optimization algorithm Harmony Search ...
Optimal linear and nonlinear control design for chaotic systems
(2005-12-01)
In this work, the linear and nonlinear feedback control techniques for chaotic systems were been considered. The optimal nonlinear control design problem has been resolved by using Dynamic Programming that reduced this ...
OPTIMAL H(INFINITY)-STATE FEEDBACK-CONTROL FOR CONTINUOUS-TIME LINEAR-SYSTEMS
(Plenum Publ CorpNew York, 1994)
Linearizability of n-linear Sirups
(Revista Computación y Sistemas; Vol. 2 No. 1, 1998-09-17)
Abstract
A linear program is easier to evaluate than a nonlinear programo Hence, given a recursive program, it is desirable to find an equivalent linear programo However, not all nonlinear programs are linearizable. ...
Multi-area decentralized optimal VAr planning using the Dantzig-Wolfe decomposition principle
(2011-05-31)
This paper presents a new methodology for solving the optimal VAr planning problem in multi-area electric power systems, using the Dantzig-Wolfe decomposition. The original multi-area problem is decomposed into subproblems ...
Multi-area decentralized optimal VAr planning using the Dantzig-Wolfe decomposition principle
(2011-05-31)
This paper presents a new methodology for solving the optimal VAr planning problem in multi-area electric power systems, using the Dantzig-Wolfe decomposition. The original multi-area problem is decomposed into subproblems ...
Problemas de Programação Linear: uma proposta de resolução geométrica para o ensino médio com o uso do GeoGebra
(Universidade Estadual Paulista (UNESP), 2016)
Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
(SPRINGER, 2010)
A method for linearly constrained optimization which modifies and generalizes recent box-constraint optimization algorithms is introduced. The new algorithm is based on a relaxed form of Spectral Projected Gradient iterations. ...