Approximate greatest descent methods for optimization with equality constraints
From MaRDI portal
Publication:535080
DOI10.1007/S10957-010-9765-3zbMATH Open1211.90231OpenAlexW2092323994MaRDI QIDQ535080FDOQ535080
Authors: B. S. Goh 
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
Recommendations
- On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints
- Equality and inequality constrained optimization algorithms with convergent stepsizes
- Publication:3200487
- Approximate greatest descent method and quasi-Newton matrices in optimization
- scientific article
- scientific article; zbMATH DE number 6310859
- ODE methods for optimization with equality constraints
- scientific article; zbMATH DE number 169297
- A globally convergent penalty-free method for optimization with equality constraints and simple bounds
- A penalty-free method for equality constrained optimization
optimizationLagrange multipliersNewton methodequality constraintsaccessory functionapproximate greatest descent iteration
Cites Work
- Title not available (Why is that?)
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Title not available (Why is that?)
- On the Global Convergence of a Filter--SQP Algorithm
- Differential games, dynamic optimization, and generalized control theory
- On the method of multipliers for mathematical programming problems
- Greatest descent algorithms in unconstrained optimization
- Algorithms for unconstrained optimization problems via control theory
- Control space properties of cooperative games
Cited In (9)
- ODE methods for optimization with equality constraints
- On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
- On a two-phase approximate greatest descent method for nonlinear optimization with equality constraints
- The regularization continuation method with an adaptive time step control for linearly constrained optimization problems
- The regularization continuation method for optimization problems with nonlinear equality constraints
- Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data
- On the bang-bang control approach via a component-wise line search strategy for unconstrained optimization
- A new method of moving asymptotes for large-scale linearly equality-constrained minimization
- Title not available (Why is that?)
This page was built for publication: Approximate greatest descent methods for optimization with equality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535080)
