Fetching the paper…
Reading the bibliography…
We provide a framework for obtaining error bounds for linear conic problems without assuming constraint qualifications or regularity conditions.
On approximate solutions of systems of linear inequalities
A. J. Hoffman · 1957
Earlier work this paper cites.
Convex Analysis
R. T. Rockafellar · 1970
Earlier work this paper cites.
A note on polyhedral cones
B.-S. Tam · 1976
Earlier work this paper cites.
Perfect cones
G. P. Barker · 1978
Earlier work this paper cites.
Facial reduction for a cone-convex programming problem
J. M. Borwein and H. Wolkowicz · 1981
Earlier work this paper cites.
Regularizing the abstract convex program
J. M. Borwein and H. Wolkowicz · 1981
Earlier work this paper cites.
Characterizations of optimality without constraint qualification for the abstract convex program
J. M. Borwein and H. Wolkowicz · 1982
Earlier work this paper cites.
A study of projectionally exposed cones
C.-H. Sung and B.-S. Tam · 1990
Earlier work this paper cites.
Analysis on symmetric cones
J. Faraut and A. Korányi · 1994
Earlier work this paper cites.
Duality results for conic convex programming
Z. Luo, J. F. Sturm, and S. Zhang · 1997
Earlier work this paper cites.
Error bounds in mathematical programming
J.-S. Pang · 1997
Earlier work this paper cites.
Error bounds for convex inequality systems
A. S. Lewis and J.-S. Pang · 1998
Earlier work this paper cites.
Strong conical hull intersection property, bounded linear regularity, Jameson’s property (G), and error bounds in convex optimization
H. H. Bauschke, J. M. Borwein, and W. Li · 1999
Earlier work this paper cites.
The Minnesota Notes on Jordan Algebras and Their Applications
M. Koecher · 1999
Earlier work this paper cites.
Error analysis
Z. Luo and J. F. Sturm · 2000
Earlier work this paper cites.
The geometry of semidefinite programming
G. Pataki · 2000
Earlier work this paper cites.
Error bounds for linear matrix inequalities
J. F. Sturm · 2000
Earlier work this paper cites.
Similarity and other spectral relations for symmetric cones
J. F. Sturm · 2000
Earlier work this paper cites.
On Nesterov’s approach to semi-infinite programming
L. Faybusovich · 2002
Cited alongside, same era.
Relating homogeneous cones and positive definite cones via T-algebras
C. B. Chua · 2003
Cited alongside, same era.
Jordan-algebraic approach to convexity theorems for quadratic mappings
L. Faybusovich · 2006
Cited alongside, same era.
Exact duality for optimization over symmetric cones
I. Pólik and T. Terlaky · 2007
Cited alongside, same era.
Invariance and efficiency of convex representations
C. B. Chua and L. Tunçel · 2008
Cited alongside, same era.
Several Jordan-algebraic aspects of optimization
L. Faybusovich · 2008
Cited alongside, same era.
A relaxed-certificate facial reduction algorithm based on subspace intersection
H. A. Friberg · 2016
Later among the works it cites.
A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
S. Kim, M. Kojima, and K.-C. Toh · 2016
Later among the works it cites.
Private Communication, 2016
F. Permenter · 2016
Later among the works it cites.
“Efficient” Subgradient Methods for General Convex Optimization
J. Renegar · 2016
Later among the works it cites.
Error bounds for nonlinear semidefinite optimization
H. Yamashita · 2016
Later among the works it cites.
A robust Lagrangian-DNN method for a class of quadratic optimization problems
N. Arima, S. Kim, M. Kojima, and K.-C. Toh · 2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Schur complements, Schur determinantal and Haynsworth inertia formulas in Euclidean Jordan algebras
M. S. Gowda and R. Sznajder · 2010
Cited alongside, same era.
On optimization over the doubly nonnegative cone
A. Yoshise and Y. Matsukawa · 2010
Cited alongside, same era.
Strong duality and minimal representations for cone optimization
L. Tunçel and H. Wolkowicz · 2012
Cited alongside, same era.
Preprocessing and regularization for degenerate semidefinite programs
Y.-L. Cheung, S. Schurr, and H. Wolkowicz · 2013
Cited alongside, same era.
On the connection of facially exposed and nice cones
G. Pataki · 2013
Cited alongside, same era.
Strong duality in conic linear programming: Facial reduction and extended duals
G. Pataki · 2013
Cited alongside, same era.
A note on alternating projections for ill-posed semidefinite feasibility problems
D. Drusvyatskiy, G. Li, and H. Wolkowicz · 2017
Closest in time.
The many faces of degeneracy in conic optimization
D. Drusvyatskiy and H. Wolkowicz · 2017
Closest in time.
Variational Analysis of Regular Mappings: Theory and Applications
A. D. Ioffe · 2017
Closest in time.
A bound on the Carathéodory number
M. Ito and B. F. Lourenço · 2017
Closest in time.
Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
F. Permenter, H. A. Friberg, and E. D. Andersen · 2017
Closest in time.
Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
F. Permenter and P. Parrilo · 2017
Closest in time.
Facially dual complete (nice) cones and lexicographic tangents
V. Roshchina and L. Tunçel · 2017
Closest in time.
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
M. Liu and G. Pataki · 2018
Closest in time.
Facial reduction and partial polyhedrality
B. F. Lourenço, M. Muramatsu, and T. Tsuchiya · 2018
Closest in time.
Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
B. F. Lourenço, E. H. Fukuda, and M. Fukushima · 2018
Closest in time.
Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
Y. (Melody)Zhu, G. Pataki, and Q. Tran-Dinh · 2019
Closest in time.