A proximal gradient descent method for the extended second-order cone linear complementarity problem
From MaRDI portal
Publication:2268076
DOI10.1016/j.jmaa.2010.01.011zbMath1194.90101OpenAlexW2036928369MaRDI QIDQ2268076
Publication date: 10 March 2010
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2010.01.011
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (5)
Independent component analysis based on fast proximal gradient ⋮ Error bounds for affine variational inequalities with second-order cone constraints ⋮ Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects ⋮ A class of alternating linearization algorithms for nonsmooth convex optimization ⋮ The PMCGAOR and PMCSSOR methods for solving linear complementarity problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A damped Gauss-Newton method for the second-order cone complementarity problem
- The \(SC^1\) property of the squared norm of the SOC Fischer-Burmeister function
- A coordinate gradient descent method for nonsmooth separable minimization
- Growth behavior of two classes of merit functions for symmetric cone complementarity problems
- Merit functions for semi-definite complementarity problems
- Some optimization reformulations of the extended linear complementarity problem
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Reducing a monotone horizontal LCP to an LCP
- A matrix-splitting method for symmetric affine second-order cone complementarity problems
- On the solution of the extended linear complementarity problem
- On the extended linear complementarity problem
- Box-constrained minimization reformulations of complementarity problems in second-order cones
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Three-dimensional quasi-static frictional contact by using second-order cone linear complementarity problem
- VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
- A generalized proximal point algorithm for certain non-convex minimization problems
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- The Generalized Order Linear Complementarity Problem
- Stability Analysis of Variational Inequalities and Nonlinear Complementarity Problems, via the Mixed Linear Complementarity Problem and Degree Theory
- The Extended Linear Complementarity Problem
- A Limited Memory Algorithm for Bound Constrained Optimization
- A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
This page was built for publication: A proximal gradient descent method for the extended second-order cone linear complementarity problem
