Block Coordinate Descent Methods for Semidefinite Programming
From MaRDI portal
Publication:2802537
DOI10.1007/978-1-4614-0769-0_19zbMath1334.90118OpenAlexW17407774MaRDI QIDQ2802537
Katya Scheinberg, Donald Goldfarb, ZaiWen Wen
Publication date: 26 April 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_19
Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (17)
An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization ⋮ Approximating the little Grothendieck problem over the orthogonal and unitary groups ⋮ Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization ⋮ Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization ⋮ A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming ⋮ On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization ⋮ Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version ⋮ Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function ⋮ On the complexity analysis of randomized block-coordinate descent methods ⋮ FANOK: Knockoffs in Linear Time ⋮ Multi-label Lagrangian support vector machine with random block coordinate descent method ⋮ A penalty decomposition method for rank minimization problem with affine constraints ⋮ Phase recovery, MaxCut and complex semidefinite programming ⋮ Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations ⋮ An alternating minimization method for robust principal component analysis ⋮ Global Registration of Multiple Point Clouds Using Semidefinite Programming ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparse inverse covariance estimation with the graphical lasso
- Fixed point and Bregman iterative methods for matrix rank minimization
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A boundary point method to solve semidefinite programs
- A coordinate gradient descent method for nonsmooth separable minimization
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A variable-penalty alternating directions method for convex optimization
- On the convergence of the coordinate descent method for convex differentiable minimization
- A proximal-based deomposition method for compositions method for convex minimization problems
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Robust convex quadratically constrained programs
- Second-order cone programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- The Schur complement and its applications
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
- Dual coordinate ascent methods for non-strictly convex minimization
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- Local minima and convergence in low-rank semidefinite programming
- Solving semidefinite programming problems via alternating direction methods
- Exact matrix completion via convex optimization
- Global and uniform convergence of subspace correction methods for some convex optimization problems
- A projected gradient algorithm for solving the maxcut SDP relaxation
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- A Singular Value Thresholding Algorithm for Matrix Completion
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Semidefinite optimization
- Necessary and sufficient conditions for a penalty method to be exact
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Globally convergent block-coordinate techniques for unconstrained optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- A Spectral Bundle Method for Semidefinite Programming
- Proximal Decomposition Via Alternating Linearization
- Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Regularization Methods for Semidefinite Programming
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- On search directions for minimization algorithms
- Robust Portfolio Selection Problems
- A descent method for structured monotone variational inequalities
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Convergence of a block coordinate descent method for nondifferentiable minimization
This page was built for publication: Block Coordinate Descent Methods for Semidefinite Programming
