Accelerated first-order methods for a class of semidefinite programs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5485536 (Why is no real title available?)
- scientific article; zbMATH DE number 3658558 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- A Stochastic Smoothing Algorithm for Semidefinite Programming
- A linear-time algorithm for trust region problems
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- A randomized mirror-prox method for solving structured large-scale matrix saddle-point problems
- A second-order cone based approach for solving the trust-region subproblem and its variants
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
- An optimal-storage approach to semidefinite programming using approximate complementarity
- Clustering subgaussian mixtures by semidefinite programming
- Complementarity and nondegeneracy in semidefinite programming
- Computing a Trust Region Step
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Dual quadratic estimates in polynomial and Boolean programming
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Exact Recovery in the Stochastic Block Model
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Exactness conditions for an SDP relaxation of the extended trust region problem
- Excessive Gap Technique in Nonsmooth Convex Minimization
- First-order methods of smooth convex optimization with inexact oracle
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior Point Trajectories in Semidefinite Programming
- KKT-based primal-dual exactness conditions for the Shor relaxation
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm
- Lectures on convex optimization
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Low-rank spectral optimization via gauge duality
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Memory-efficient structured convex optimization via extreme point sampling
- Necessary and Sufficient Conditions for Rank-One-Generated Cones
- Novel reformulations and efficient algorithms for the generalized trust region subproblem
- On Cones of Nonnegative Quadratic Functions
- On a positive semidefinite relaxation of the cut polytope
- On general minimax theorems
- On the Burer-Monteiro method for general semidefinite programs
- On the ergodic convergence rates of a first-order primal-dual algorithm
- On the simplicity and conditioning of low rank semidefinite programs
- On the tightness of SDP relaxations of QCQPs
- Phase retrieval via matrix completion
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Quadratic Matrix Programming
- Rank optimality for the Burer-Monteiro factorization
- Scalable semidefinite programming
- Semidefinite Programming
- Size matters: cardinality-constrained clustering and outlier detection via conic optimization
- Smooth minimization of non-smooth functions
- Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
- The generalized trust region subproblem: solution complexity and convex hull results
- The measure of the critical values of differentiable maps
- The trust region subproblem with non-intersecting linear constraints
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
This page was built for publication: Accelerated first-order methods for a class of semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665390)
