Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity
From MaRDI portal
Publication:1782218
DOI10.1007/s10440-018-0158-1zbMath1395.90202OpenAlexW2789656489MaRDI QIDQ1782218
Publication date: 19 September 2018
Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10440-018-0158-1
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Theoretical approximation of solutions to ordinary differential equations (34A45)
Cites Work
- Unnamed Item
- Linear complementarity problem with pseudomonotonicity on Euclidean Jordan algebras
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Analyticity of weighted central paths and error bounds for semidefinite programming
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Global error bound for the generalized linear complementarity problem over a polyhedral cone
- Applications of second-order cone programming
- Complementarity problems over cones with monotone and pseudomonotone maps
- Error bounds in mathematical programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Second-order cone programming
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Product-form Cholesky factorization in interior point methods for second-order cone programming
- On the range of the pseudomonotone second-order cone linear complementarity problem
- Two wide neighborhood interior-point methods for symmetric cone optimization
- Variational analysis and applications. Proceedings of the 38th conference of the School of Mathematics ``G. Stampacchia in memory of G. Stampacchia and J.-L. Lions, Erice, Italy, June 20--July 1, 2003.
- Solution analysis for the pseudomonotone second-order cone linear complementarity problem
- Pseudomonotonicity and related properties in Euclidean Jordan algebras
- A Lipschitzian error bound for monotone symmetric cone linear complementarity problem
- Error Bounds for Linear Matrix Inequalities
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming
- Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
- On sensitivity of central solutions in semidefinite programming
This page was built for publication: Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity
