Tight error bounds for log-determinant cones without constraint qualifications
From MaRDI portal
Cites work
- A unified approach to error bounds for structured convex optimization problems
- Amenable cones are particularly nice
- Amenable cones: error bounds without constraint qualifications
- An efficient linearly convergent regularized proximal point algorithm for fused multiple graphical Lasso problems
- Cones of diagonally dominant matrices
- Conic Optimization with Spectral Functions on Euclidean Jordan Algebras
- Convergence analysis under consistent error bounds
- Determinantal point processes for machine learning
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Error Bounds for Linear Matrix Inequalities
- Error bounds in mathematical programming
- Error bounds, facial residual functions and applications to the exponential cone
- Facial reduction algorithms for conic optimization problems
- Facial reduction and partial polyhedrality
- First-Order Methods for Sparse Covariance Selection
- Fused multiple graphical lasso
- Gaussian Markov Random Fields
- Generalized power cones: optimal error bounds and automorphisms
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1328979 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- Minimum-volume ellipsoids. Theory and algorithms
- On Projection Algorithms for Solving Convex Feasibility Problems
- Optimal and Efficient Designs of Experiments
- Performance enhancements for a generic conic interior point algorithm
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
- Regularizing the abstract convex program
- Several Jordan-algebraic aspects of optimization†
- Solving Natural Conic Formulations with Hypatia.jl
- Sparse inverse covariance estimation with the graphical lasso
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Strong duality in conic linear programming: facial reduction and extended duals
This page was built for publication: Tight error bounds for log-determinant cones without constraint qualifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995577)
