Active-set Newton methods for mathematical programs with vanishing constraints
From MaRDI portal
Publication:1928752
DOI10.1007/S10589-012-9467-XzbMATH Open1284.90077OpenAlexW2061270349MaRDI QIDQ1928752FDOQ1928752
Authors: A. L. Pogosyan, A. 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
Recommendations
- Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- A semismooth sequential quadratic programming method for lifted mathematical programs with vanishing constraints
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- On a relaxation method for mathematical programs with vanishing constraints
sequential quadratic programmingglobal convergenceoptimality conditionconstraint qualificationsemismooth Newton methodactive-set methodmathematical program with vanishing constraints
Cites Work
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Stability in the presence of degeneracy and error estimation
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Optimization and nonsmooth analysis
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- On the Accurate Identification of Active Constraints
- Growth behavior of a class of merit functions for the nonlinear complementarity problem
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
- Regularity Properties of a Semismooth Reformulation of Variational Inequalities
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- Exact penalty results for mathematical programs with vanishing constraints
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
- Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- An inexact SQP Newton method for convex SC\(^{1}\) minimization problems
Cited In (8)
- A new active-set strategy for NCP with degenerate solutions
- Nonsmooth Mathematical Programs with Vanishing Constraints in Banach Spaces
- On M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraints
- Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
- Focus programming: a bi‐level programming approach to static stochastic optimization problems
- On duality for mathematical programs with vanishing constraints
- Active set and interior methods for nonlinear optimization
- Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints
This page was built for publication: Active-set Newton methods for mathematical programs with vanishing constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928752)
