A Lipschitzian error bound for convex quadratic symmetric cone programming

DOI10.1007/s10440-015-0037-yzbMath1346.90670OpenAlexW2225521236MaRDI QIDQ312538

Huiling Lin

Publication date: 16 September 2016

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10440-015-0037-y

zbMATH Keywords

error boundeigenvalue minimization 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the nearest correlation matrix--a problem from finance
• Sensor network localization, Euclidean distance matrix completions, and graph realization
• On the stable solution of large scale problems over the doubly nonnegative cone
• An inexact spectral bundle method for convex quadratic semidefinite programming
• Convex analysis and nonlinear optimization. Theory and examples.
• Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
• Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
• Minimum principle sufficiency
• Error bounds in mathematical programming
• Extensions of Fréchet \(\varepsilon\)-subdifferential calculus and applications
• Global error bounds for piecewise convex polynomials
• A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
• An application of the nearest correlation matrix on web document classification
• Der Min-Max-Satz von E. Fischer für formal-reelle Jordan-Algebren
• Weak sharp minima revisited. II: Application to linear regularity and error bounds
• Error bounds for eigenvalue and semidefinite matrix inequality systems
• The Cauchy interlacing theorem in simple Euclidean Jordan algebras and some consequences
• Weak Sharp Minima in Mathematical Programming
• Global Error Bounds for Convex Conic Problems
• First-Order and Second-Order Conditions for Error Bounds
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• The Euclidian Distance Matrix Completion Problem
• Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
• Error Bounds for Piecewise Convex Quadratic Programs and Applications
• Nonsmooth sequential analysis in Asplund spaces
• A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
• Euclidean Distance Geometry and Applications
• Convex Analysis
• On sensitivity of central solutions in semidefinite programming
• A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions

This page was built for publication: A Lipschitzian error bound for convex quadratic symmetric cone programming