A projected Newton method for minimization problems with nonlinear inequality constraints
From MaRDI portal
Publication:1095798
DOI10.1007/BF01396325zbMath0632.90058OpenAlexW2044362121MaRDI QIDQ1095798
Publication date: 1988
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133282
constrained minimizationpolyhedronslocally superlinearly convergencemultistage discrete-time optimal controlprojected Newton methodssecond order Kuhn-Tucker sufficient conditionssmooth nonlinear inequalities
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Newton-type methods (49M15)
Related Items
Sequential quadratic programming algorithm for discrete optimal control problems with control inequality constraints, Family of projected descent methods for optimization problems with simple bounds, Efficient sequential quadratic programming implementations for equality-constrained discrete-time optimal control, Solution of projection problems over polytopes, A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming, Dynamic programming method for constrained discrete-time optimal control, Interior point methods for optimal control of discrete time systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of superlinearly convergent projection algorithms with relaxed stepsizes
- Newton's method for singular constrained optimization problems
- A projected Newton method in a Cartesian product of balls
- Asymptotic decay rates from the growth properties of Lyapunov functions near singular attractors
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
- Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Differential dynamic programming and separable programs
- On the convergence of projected gradient processes to singular critical points
- A stable approach to Newton's method for general mathematical programming problems in R\(^n\)
- Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions
- On Newton's method
- Two-Metric Projection Methods for Constrained Optimization
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Convergence Rates for Newton’s Method at Singular Points
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- Continuity of the null space basis and constrained optimization
- On the Identification of Active Constraints
- The computation of Lagrange-multiplier estimates for constrained minimization
- Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- On the Goldstein-Levitin-Polyak gradient projection method
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Projected Newton Methods for Optimization Problems with Simple Constraints
