Smoothing method for mathematical programs with symmetric cone complementarity constraints
From MaRDI portal
Publication:2996793
Recommendations
- On the convergence properties of a smoothing approach for mathematical programs with symmetric cone complementarity constraints
- A smoothing method for mathematical programs with complementarity constraints
- A new smoothing method for mathematical programs with complementarity constraints
- A class of smoothing methods for mathematical programs with complementarity constraints
- A new smoothing scheme for mathematical programs with complementarity constraints
Cites work
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A modified relaxation scheme for mathematical programs with complementarity constraints
- A smoothing method for mathematical programs with equilibrium constraints
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Exact Penalization of Mathematical Programs with Equilibrium Constraints
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Monte Carlo and quasi-Monte Carlo sampling methods for a class of stochastic mathematical programs with equilibrium constraints
- New relaxation method for mathematical programs with complementarity constraints
- Second-order cone programming
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- Smoothing methods for convex inequalities and linear complementarity problems
- Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Some P-properties for linear transformations on Euclidean Jordan algebras
Cited in
(24)- First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints
- A proximal point algorithm for the monotone second-order cone complementarity problem
- A smoothing method for mathematical programs with equilibrium constraints
- A log-exponential smoothing method for mathematical programs with complementarity constraints
- scientific article; zbMATH DE number 7442528 (Why is no real title available?)
- 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
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- 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
- Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints
- Extension of smoothing functions to symmetric cone complementarity problems
- New constraint qualifications for mathematical programs with second-order cone complementarity constraints
- A smoothing method for a mathematical program with P-matrix linear complementarity constraints
- A class of smoothing methods for mathematical programs with complementarity constraints
- Analysis of a smoothing method for symmetric conic linear programming
- Mathematical programs with complementarity constraints in Banach spaces
- A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations
- Complementarity problems over symmetric cones: A survey of recent developments in several aspects
- A smoothing SQP method for mathematical programs with linear second-order cone complementarity constraints
- Scaled constraint qualifications and necessary optimality conditions for nonsmooth mathematical programs with second-order cone complementarity constraints
- Facial approach for constructing stationary points for mathematical programs with 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: Smoothing method for mathematical programs with symmetric cone complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996793)