Convex quartic problems: homogenized gradient method and preconditioning
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 775040 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A geometric analysis of phase retrieval
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- An Algorithm for Restricted Least Squares Regression
- Approximation of zonoids by zonotopes
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Effective graph resistance
- Ellipsoidal approximations of convex sets based on the volumetric barrier
- Euclidean distance matrix completion problems
- Finite dimensional subspaces of $L_{p}$
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- First-order methods in optimization
- From error bounds to the complexity of first-order descent methods for convex functions
- Inexact basic tensor methods for some classes of convex optimization problems
- Minimum-volume ellipsoids. Theory and algorithms
- New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure
- Optimal complexity and certification of Bregman first-order methods
- Phase retrieval via Wirtinger flow: theory and algorithms
- Projection Methods in Conic Optimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Quartic first-order methods for low-rank minimization
- Randomized Algorithms for Matrices and Data
- Randomized numerical linear algebra: Foundations and algorithms
- Relatively smooth convex optimization by first-order methods, and applications
- Rounding of Polytopes in the Real Number Model of Computation
- Rounding of convex sets and efficient gradient methods for linear programming problems
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The effect of coherence on sampling from matrices with orthonormal columns, and preconditioned least squares problems
- _p row sampling by Lewis weights
This page was built for publication: Convex quartic problems: homogenized gradient method and preconditioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994533)
