Approximate greatest descent methods for optimization with equality constraints
From MaRDI portal
Publication:535080
DOI10.1007/s10957-010-9765-3zbMath1211.90231MaRDI QIDQ535080
Publication date: 11 May 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-010-9765-3
optimization; Lagrange multipliers; equality constraints; Newton method; accessory function; approximate greatest descent iteration
90C30: Nonlinear programming
Related Items
On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints, On the bang-bang control approach via a component-wise line search strategy for unconstrained optimization, Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data, The regularization continuation method with an adaptive time step control for linearly constrained optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Greatest descent algorithms in unconstrained optimization
- Algorithms for unconstrained optimization problems via control theory
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Control space properties of cooperative games
- Differential games, dynamic optimization, and generalized control theory
- On the method of multipliers for mathematical programming problems
- On the Global Convergence of a Filter--SQP Algorithm