Thep-Factor-Lagrange Methods for Degenerate Nonlinear Programming
From MaRDI portal
Publication:5452406
DOI10.1080/01630560701587809zbMath1133.90396OpenAlexW1965710600MaRDI QIDQ5452406
Alexey A. Tret'yakov, Olga A. Brezhneva
Publication date: 4 April 2008
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630560701587809
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on necessary conditions (49M05)
Related Items (7)
Degenerate equality constrained optimization problems and P-regularity theory ⋮ Locally polynomial method for solving systems of linear inequalities ⋮ A new view of some fundamental results in optimization ⋮ On reductibility of degenerate optimization problems to regular operator equations ⋮ Come Back to Lagrange. Thep-Factor Analysis of Optimality Conditions ⋮ Constructive generalization of classical sufficient second-order optimality conditions ⋮ Nonregular mixed-constrained optimization problems
Cites Work
- Unnamed Item
- The \(p\)th-order optimality conditions for inequality constrained optimization problems
- Generalized Lagrange multiplier technique for nonlinear programming
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Stabilized sequential quadratic programming
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods
- Constraint identification and algorithm stabilization for degenerate nonlinear programs
- Factor-analysis of nonlinear mappings: \(p\)-regularity theory
- Necessary and sufficient conditions for optimality of p-th order
- On the Accurate Identification of Active Constraints
- Numerical Optimization
- Optimality Conditions for Degenerate Extremum Problems with Equality Constraints
- Newton-Type Methods for Optimization Problems without Constraint Qualifications
- The implicit function theorem in degenerate problems
- Methods for solving degenerate problems
- Modifying SQP for Degenerate Problems
- Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers
- An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
This page was built for publication: Thep-Factor-Lagrange Methods for Degenerate Nonlinear Programming