A Lipschitzian error bound for monotone symmetric cone linear complementarity problem

DOI10.1080/02331934.2014.979323zbMath1327.90191OpenAlexW2130066378MaRDI QIDQ3453409

Michel Baes, Huiling Lin

Publication date: 27 November 2015

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2014.979323

zbMATH Keywords

error boundcomplementarity problemquadratic symmetric cone programming

Mathematics Subject Classification ID

Convex programming (90C25) Theoretical approximation of solutions to ordinary differential equations (34A45) Error analysis and interval analysis (65G99)

Related Items

Amenable cones: error bounds without constraint qualifications, Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity

Cites Work

• Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
• Schur complements, Schur determinantal and Haynsworth inertia formulas in Euclidean Jordan algebras
• Analyticity of weighted central paths and error bounds for semidefinite programming
• Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
• Error bounds in mathematical programming
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Euclidean Jordan algebras and interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• 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.
• Weak sharp minima revisited. II: Application to linear regularity and error bounds
• Interior-point methods based on kernel functions for symmetric optimization
• The Cauchy interlacing theorem in simple Euclidean Jordan algebras and some consequences
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Weak Sharp Minima in Mathematical Programming
• Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
• Error Bounds for Linear Matrix Inequalities
• Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming