Active-set Newton methods for mathematical programs with vanishing constraints
From MaRDI portal
Publication:1928752
DOI10.1007/s10589-012-9467-xzbMath1284.90077OpenAlexW2061270349MaRDI QIDQ1928752
A. L. Pogosyan, Alexey F. Izmailov
Publication date: 4 January 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9467-x
global convergencesequential quadratic programmingoptimality conditionconstraint qualificationsemismooth Newton methodactive-set methodmathematical program with vanishing constraints
Related Items
On M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraints ⋮ On duality for mathematical programs with vanishing constraints ⋮ Focus programming: a bi‐level programming approach to static stochastic optimization problems ⋮ Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
Cites Work
- Unnamed Item
- Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
- An inexact SQP Newton method for convex SC\(^{1}\) minimization problems
- Exact penalty results for mathematical programs with vanishing constraints
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- 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
- A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- Growth behavior of a class of merit functions for the nonlinear complementarity problem
- Optimality conditions and newton-type methods for mathematical programs with vanishing constraints
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Optimization and nonsmooth analysis
- Regularity Properties of a Semismooth Reformulation of Variational Inequalities
- On the Accurate Identification of Active Constraints
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Benchmarking optimization software with performance profiles.
