A projected Newton method for minimization problems with nonlinear inequality constraints
Recently developed projected Newton methods for minimization problems in polyhedrons and Cartesian products of Euclidean balls are extended here to general convex feasible sets defined by finitely many smooth nonlinear inequalities. Iterate sequences generated by this scheme are shown to be locally superlinearly convergent to nonsingular extremals ū, and more specifically, to local minimizers ū satisfying the standard second order Kuhn-Tucker sufficient conditions; moreover, all such convergent iterate sequences eventually enter and remain within the smooth manifold defined by the active constraints at ū. Implementation issues are considered for large scale specially structured nonlinear programs, and in particular, for multistage discrete-time optimal control problems; in the latter case, overall per iteration computational costs will typically increase only linearly with the number of stages. Sample calculations are presented for nonlinear progams in a right circular cylinder in \({\mathbb{R}}^ 3\).
- A projected Newton method in a Cartesian product of balls
- scientific article; zbMATH DE number 2049020
- Some improved projected quasi-Newton algorithms and their convergence. I: Methods and global behavior
- Solution of Optimal Control Problems by a Pointwise Projected Newton Method
- A projective quasi-Newton method for nonlinear optimization
- A class of superlinearly convergent projection algorithms with relaxed stepsizes
- A projected Newton method in a Cartesian product of balls
- A stable approach to Newton's method for general mathematical programming problems in R\(^n\)
- Asymptotic decay rates from the growth properties of Lyapunov functions near singular attractors
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Continuity of the null space basis and constrained optimization
- Convergence Rates for Newton’s Method at Singular Points
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Differential dynamic programming and separable programs
- Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems
- Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 4100967 (Why is no real title available?)
- scientific article; zbMATH DE number 3177943 (Why is no real title available?)
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- Newton's method for singular constrained optimization problems
- Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions
- Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
- On Newton's method
- On the convergence of projected gradient processes to singular critical points
- On the Goldstein-Levitin-Polyak gradient projection method
- On the Identification of Active Constraints
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Superlinearly convergent quasi-Newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- The computation of Lagrange-multiplier estimates for constrained minimization
- Two-Metric Projection Methods for Constrained Optimization
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
- 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
- Family of projected descent methods for optimization problems with simple bounds
- Efficient sequential quadratic programming implementations for equality-constrained discrete-time optimal control
- Inexact Newton method with feasible inexact projections for solving constrained smooth and nonsmooth equations
- scientific article; zbMATH DE number 4102827 (Why is no real title available?)
- Sequential quadratic programming algorithm for discrete optimal control problems with control inequality constraints
- scientific article; zbMATH DE number 2049020 (Why is no real title available?)
- A projected gradient and constraint linearization method for nonlinear model predictive control
This page was built for publication: A projected Newton method for minimization problems with nonlinear inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095798)