Newton-type methods for constrained optimization with nonregular constraints
From MaRDI portal
Publication:6122341
DOI10.1134/s0965542506080045OpenAlexW2075823376MaRDI QIDQ6122341
M. M. Golishnikov, Alexey F. Izmailov
Publication date: 1 March 2024
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/zvmmf425
sequential quadratic programmingNewton-type methodsconstraint qualificationssemismooth Newton methodsconstrained optimization problemsactive set methods
Related Items
Some properties of two-dimensional surjective \(p\)-homogeneous maps ⋮ The Dines theorem and some other properties of quadratic mappings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Test examples for nonlinear programming codes
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Stabilized sequential quadratic programming
- Stability in the presence of degeneracy and error estimation
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- On the solution of mathematical programming problems with equilibrium constraints
- Constraint identification and algorithm stabilization for degenerate nonlinear programs
- On the rate of convergence of sequential quadratic programming with nondifferentiable exact penalty function in the presence of constraint degeneracy
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- Superlinear Convergence of an Interior-Point Method Despite Dependent Constraints
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- On the Accurate Identification of Active Constraints
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Degenerate Nonlinear Programming with a Quadratic Growth Condition
- Newton-Type Methods for Optimization Problems without Constraint Qualifications
- Solving mathematical programs with complementarity constraints as nonlinear programs
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- Modifying SQP for Degenerate Problems
- Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- On the Classical Necessary Second-Order Optimality Conditions in the Presence of Equality and Inequality Constraints
- An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
- On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints
- How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
- Nonlinear programming without a penalty function.
