An approximate lower order penalty approach for solving second-order cone linear complementarity problems
From MaRDI portal
Publication:2154446
DOI10.1007/s10898-021-01116-wzbMath1495.90215OpenAlexW3217401669MaRDI QIDQ2154446
Zijun Hao, Chieu Thanh Nguyen, Jein-Shan Chen
Publication date: 19 July 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01116-w
linear complementarity problemexponential convergence ratesecond-order conelower order penalty approach
Convex programming (90C25) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A penalty function method based on smoothing lower order penalty function
- A modified smoothing and regularized Newton method for monotone second-order cone complementarity problems
- Analysis of nonsmooth vector-valued functions associated with second-order cones.
- A damped Gauss-Newton method for the second-order cone complementarity problem
- Two classes of merit functions for the second-order cone complementarity problem
- A power penalty method for linear complementarity problems
- Smoothing algorithms for complementarity problems over symmetric cones
- Applications of second-order cone programming
- Second-order cone programming
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- SOC functions and their applications
- A matrix-splitting method for symmetric affine second-order cone complementarity problems
- A power penalty method for second-order cone linear complementarity problems
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- A class of smoothing functions for nonlinear and mixed complementarity problems
- A descent method for a reformulation of the second-order cone complementarity problem
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- An Efficient Matrix Splitting Method for the Second-Order Cone Complementarity Problem
- The convex and monotone functions associated with second-order cone
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Exact penalty functions in nonlinear programming
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- An exact lower order penalty function and its smoothing in nonlinear programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- The Extended Linear Complementarity Problem
- 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
- Equilibrium Points of Bimatrix Games
- Lower-order penalty methods for mathematical programs with complementarity constraints
- Bimatrix Equilibrium Points and Mathematical Programming
- Non-Linear Programming Via Penalty Functions
- Mathematical Programs with Equilibrium Constraints
- Complementarity problems
- Benchmarking optimization software with performance profiles.