A smoothing SQP method for mathematical programs with linear second-order cone complementarity constraints
zbMATH Open1272.65054MaRDI QIDQ4921911FDOQ4921911
Authors: Hiroshi Yamamura, Takayuki Okuno, Shunsuke Hayashi, Masao Fukushima 
Publication date: 28 May 2013
Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol9/p345.html
Recommendations
- Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints
- Two approaches for solving mathematical programs with second-order cone complementarity constraints
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
- An inexact smoothing algorithm for linear second-order cone complementarity problems
- Smoothing method for mathematical programs with symmetric cone complementarity constraints
numerical resultssequential quadratic programmingmathematical programs with equilibrium constraintssecond-order cone complementarity
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (11)
- First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints
- Mathematical programs with second-order cone complementarity constraints: strong stationarity and approximation method
- Necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
- New constraint qualifications for mathematical programs with second-order cone complementarity constraints
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
- A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
- Scaled constraint qualifications and necessary optimality conditions for nonsmooth mathematical programs with second-order cone complementarity constraints
- An SQP-type algorithm for nonlinear second-order cone programs
- 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: A smoothing SQP method for mathematical programs with linear second-order cone complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4921911)
