Active-set Newton methods for mathematical programs with vanishing constraints
type: Item
instance of: scholarly article
title: Active-set Newton methods for mathematical programs with vanishing constraints
zbMATH Open document ID: 1284.90077
author: A. L. Pogosyan
author: A. F. Izmailov
published in: Computational Optimization and Applications
publication date: 2013-01-04T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C53
zbMATH DE Number: 6121900
zbMATH Keywords: mathematical program with vanishing constraints
zbMATH Keywords: constraint qualification
zbMATH Keywords: optimality condition
zbMATH Keywords: active-set method
zbMATH Keywords: sequential quadratic programming
zbMATH Keywords: semismooth Newton method
zbMATH Keywords: global convergence
MaRDI profile type: Publication
full work available at URL: s10589-012-9467-x
OpenAlex ID: W2061270349
cites work: Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
cites work: A smoothing-regularization approach to mathematical programs with vanishing constraints
cites work: Local analysis of Newton-type methods for variational inequalities and nonlinear programming
cites work: An inexact SQP Newton method for convex SC\(^{1}\) minimization problems
cites work: Optimization and nonsmooth analysis
cites work: A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
cites work: Benchmarking optimization software with performance profiles.
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Regularity Properties of a Semismooth Reformulation of Variational Inequalities
cites work: On the Accurate Identification of Active Constraints
cites work: Local behavior of an iterative framework for generalized equations with nonisolated solutions
cites work: Stability in the presence of degeneracy and error estimation
cites work: First- and second-order optimality conditions for mathematical programs with vanishing constraints.
cites work: Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
cites work: On the Abadie and Guignard constraint qualifications for Mathematical Programmes with Vanishing Constraints
cites work: Exact penalty results for mathematical programs with vanishing constraints
cites work: Optimality conditions and newton-type methods for mathematical programs with vanishing constraints
cites work: An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
cites work: Mathematical programs with vanishing constraints: Optimality conditions, sensitivity, and a relaxation method
cites work: Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
cites work: Q5491447
cites work: Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
cites work: Growth behavior of a class of merit functions for the nonlinear complementarity problem
DOI: 10.1007/S10589-012-9467-X
description: scientific article; zbMATH DE number 6121900