Sciweavers

17 search results - page 1 / 4
» The Newton Bracketing method for the minimization of convex ...
Sort
View
DAM
2008
91views more  DAM 2008»
13 years 5 months ago
The Newton Bracketing method for the minimization of convex functions subject to affine constraints
The Newton Bracketing method [9] for the minimization of convex functions f : Rn R is extended to affinely constrained convex minimization problems. The results are illustrated for...
Adi Ben-Israel, Yuri Levin
EOR
2008
93views more  EOR 2008»
13 years 5 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
CDC
2008
IEEE
146views Control Systems» more  CDC 2008»
13 years 11 months ago
Control formula for nonlinear systems subject to convex input constraints using control Lyapunov functions
— In this paper, we propose a two-step controller design method with control Lyapunov functions (CLFs) for nonlinear systems with convex input constraints. In the first step, we...
Yasuyuki Satoh, Hisakazu Nakamura, Nami Nakamura, ...
SIAMJO
2008
212views more  SIAMJO 2008»
13 years 4 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
Radek Kucera
MCS
2008
Springer
13 years 4 months ago
A nonsmooth Newton's method for control-state constrained optimal control problems
We investigate optimal control problems subject to mixed control-state constraints. The necessary conditions are stated in terms of a local minimum principle. By use of the Fischer...
Matthias Gerdts