Active-set Newton methods for mathematical programs with vanishing constraints
From MaRDI portal
(Redirected from Publication:1928752)
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
Cites work
- A smoothing-regularization approach to mathematical programs with vanishing constraints
- A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
- An inexact SQP Newton method for convex SC\(^{1}\) minimization problems
- Benchmarking optimization software with performance profiles.
- Exact penalty results for mathematical programs with vanishing constraints
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First- and second-order optimality conditions for mathematical programs with vanishing constraints.
- Growth behavior of a class of merit functions for the nonlinear complementarity problem
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
- 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
- On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
- On the Accurate Identification of Active Constraints
- Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints
- Optimization and nonsmooth analysis
- Regularity Properties of a Semismooth Reformulation of Variational Inequalities
- Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
- Stability in the presence of degeneracy and error estimation
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
Cited in
(11)- Active set and interior methods for nonlinear optimization
- On M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraints
- A new active-set strategy for NCP with degenerate solutions
- A semismooth sequential quadratic programming method for lifted mathematical programs with vanishing constraints
- Optimality conditions and Newton-type methods for mathematical programs with vanishing constraints
- On duality for mathematical programs with vanishing constraints
- Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method
- A parametric active-set method for qps with vanishing constraints arising in a robot motion planning problem
- Focus programming: a bi‐level programming approach to static stochastic optimization problems
- Nonsmooth Mathematical Programs with Vanishing Constraints in Banach Spaces
- Lagrangian-based neural network solution method for mathematical programs with vanishing constraints and its application in truss topology
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)
