A proximal point algorithm for the monotone second-order cone complementarity problem
From MaRDI portal
Publication:429513
DOI10.1007/s10589-011-9399-xzbMath1268.90108OpenAlexW2135653660MaRDI QIDQ429513
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-011-9399-x
Related Items
An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function, Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets
Cites Work
- Unnamed Item
- A damped Gauss-Newton method for the second-order cone complementarity problem
- A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property
- Applications of second-order cone programming
- Solution of monotone complementarity problems with locally Lipschitzian functions
- A semismooth equation approach to the solution of nonlinear complementarity problems
- Second-order cone programming
- On implementing a primal-dual interior-point method for conic quadratic optimization
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- A nonsmooth version of Newton's method
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- The Proximal Point Algorithm with Genuine Superlinear Convergence for the Monotone Complementarity Problem
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Smoothing method for mathematical programs with symmetric cone complementarity constraints
- A linearly convergent derivative-free descent method for the second-order cone complementarity problem
- Nonsmooth Equations: Motivation and Algorithms
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Optimization and nonsmooth analysis
- Monotone Operators and the Proximal Point Algorithm
- Semismooth and Semiconvex Functions in Constrained Optimization
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones