A smoothing-regularization approach to mathematical programs with vanishing constraints
From MaRDI portal
Publication:2393647
DOI10.1007/s10589-013-9539-6zbMath1291.90234MaRDI QIDQ2393647
Christian Kanzow, Wolfgang Achtziger, Tim Hoheisel
Publication date: 8 August 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9539-6
global convergence; regularization method; smoothing method; mathematical programs with equilibrium constraints; mathematical programs with vanishing constraints
90C30: Nonlinear programming
Related Items
Mathematical programs with vanishing constraints: constraint qualifications, their applications, and a new regularization method, On a relaxation method for mathematical programs with vanishing constraints, A study of one-parameter regularization methods for mathematical programs with vanishing constraints, A hybrid splitting method for smoothing Tikhonov regularization problem, On directionally differentiable multiobjective programming problems with vanishing constraints, On the time transformation of mixed integer optimal control problems using a consistent fixed integer control function, On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints, Exact penalty results for mathematical programs with vanishing constraints, Constraint qualifications and stationary conditions for mathematical programming with non-differentiable vanishing constraints, Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints, Active-set Newton methods for mathematical programs with vanishing constraints, An SQP method for mathematical programs with vanishing constraints with strong convergence properties, Optimality conditions and Mond-Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints, New dualities for mathematical programs with vanishing constraints, Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications, Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints, Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints, Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints, Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties, On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematical programs with vanishing constraints: critical point theory
- 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
- Foundations of optimization
- A smoothing method for mathematical programs with equilibrium constraints
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints
- 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
- Numerical Optimization
- Some properties of regularization and penalization schemes for MPECs
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints
- A two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
