Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints
DOI10.1007/S11228-011-0190-ZzbMATH Open1261.90058OpenAlexW2056424572MaRDI QIDQ763335FDOQ763335
Publication date: 9 March 2012
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11228-011-0190-z
Recommendations
- On the convergence properties of a smoothing approach for mathematical programs with symmetric cone complementarity constraints
- Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
- Two approaches for solving mathematical programs with second-order cone complementarity constraints
- Mathematical Programs with Complementarity Constraints: Convergence Properties of a Smoothing Method
- Convergence analysis of a smoothing SAA method for a stochastic mathematical program with second-order cone complementarity constraints
smoothing approximationC-stationary pointM-stationary pointB-stationary pointmathematical program with second-order cone complementarity constraintS-stationary point
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- Foundations of bilevel programming
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Optimization and nonsmooth analysis
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- On the coderivative of the projection operator onto the second-order cone
- A smoothing method for mathematical programs with equilibrium constraints
- A modified relaxation scheme for mathematical programs with complementarity constraints
- Coderivative Analysis of Quasi‐variational Inequalities with Applications to Stability and Optimization
- Optimality Conditions for a Class of Mathematical Programs with Equilibrium Constraints
- Smoothing functions for second-order-cone complementarity problems
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- The \(SC^1\) property of the squared norm of the SOC Fischer-Burmeister function
- Smoothing method for mathematical programs with symmetric cone complementarity constraints
- Title not available (Why is that?)
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- A smoothing method for a mathematical program with P-matrix linear complementarity constraints
Cited In (22)
- Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints
- First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints
- A penalty method for rank minimization problems in symmetric matrices
- Mathematical programs with second-order cone complementarity constraints: strong stationarity and approximation method
- First-order and second-order optimality conditions for nonsmooth constrained problems via convolution smoothing
- The models of bilevel programming with lower level second-order cone programs
- On the convergence properties of a smoothing approach for mathematical programs with symmetric cone complementarity constraints
- On the coderivative of the solution mapping to a second-order cone constrained parametric variational inequality
- Necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
- First order necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
- Analysis of smoothing-type algorithms for the convex second-order cone programming
- New constraint qualifications for mathematical programs with second-order cone complementarity constraints
- Title not available (Why is that?)
- Smoothing functions for second-order-cone complementarity problems
- Mathematical Programs with Complementarity Constraints: Convergence Properties of a Smoothing Method
- A perturbation approach for an inverse quadratic programming problem over second-order cones
- Facial approach for constructing stationary points for mathematical programs with cone complementarity constraints
- Scaled constraint qualifications and necessary optimality conditions for nonsmooth mathematical programs with second-order cone complementarity constraints
- Regular and limiting normal cones to the graph of the subdifferential mapping of the nuclear norm
- Convergence analysis of a smoothing SAA method for a stochastic mathematical program with second-order cone complementarity constraints
- Second order sufficient conditions for a class of bilevel programs with lower level second-order cone programming problem
- Two approaches for solving mathematical programs with second-order cone complementarity constraints
This page was built for publication: Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763335)