Smoothing methods for mathematical programs with second-order cone complementarity constraints
From MaRDI portal
Cites work
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A new one-step smoothing Newton method for second-order cone programming.
- A one-step smoothing Newton method for second-order cone programming
- A perturbation approach for an inverse quadratic programming problem over second-order cones
- A smoothing Newton method for second-order cone optimization based on a new smoothing function
- A smoothing Newton method for the second-order cone complementarity problem.
- A smoothing SQP method for mathematical programs with linear second-order cone complementarity constraints
- A survey on SOC complementarity functions and solution methods for SOCPs and SOCCPs
- Analysis of nonsmooth vector-valued functions associated with second-order cones.
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints
- Exact formula for the second-order tangent set of the second-order cone complementarity set
- Exact formulas for the proximal/regular/limiting normal cone of the second-order cone complementarity set
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- First order necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
- First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 1424524 (Why is no real title available?)
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Mathematical Programs with Equilibrium Constraints
- Mathematical programs with second-order cone complementarity constraints: strong stationarity and approximation method
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
- Necessary optimality conditions for mathematical programs with second-order cone complementarity constraints
- New constraint qualifications for mathematical programs with second-order cone complementarity constraints
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Notes on some constraint qualifications for mathematical programs with equilibrium constraints
- Robust optimization-methodology and applications
- Second-order cone programming
- Smoothing functions for second-order-cone complementarity problems
- Smoothing method for mathematical programs with symmetric cone complementarity constraints
- Two approaches for solving mathematical programs with second-order cone complementarity constraints
This page was built for publication: Smoothing methods 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 Q7300537)