A Lipschitzian error bound for monotone symmetric cone linear complementarity problem

DOI10.1080/02331934.2014.979323MaRDI QIDQ3453409zbMATH OpenOpenAlexFDO

Authors 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

complementarity problemerror boundquadratic symmetric cone programming

Mathematics Subject Classification ID

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

Recommendations

• A Lipschitzian error bound for convex quadratic symmetric cone programming
• Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity
• Error bounds for symmetric cone complementarity problems
• Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
• Error bounds for monotone linear complementarity problems

Cites work

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

Cited in

(5)

• Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
• Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity
• Amenable cones: error bounds without constraint qualifications
• A Lipschitzian error bound for convex quadratic symmetric cone programming
• Error bounds for symmetric cone complementarity problems

This page was built for publication: A Lipschitzian error bound for monotone symmetric cone linear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453409)