Block coordinate descent methods for semidefinite programming
From MaRDI portal
Publication:2802537
DOI10.1007/978-1-4614-0769-0_19zbMATH Open1334.90118OpenAlexW17407774MaRDI QIDQ2802537FDOQ2802537
Authors: Zaiwen Wen, Donald Goldfarb, Katya Scheinberg 
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
Recommendations
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs
- An efficient inexact ABCD method for least squares semidefinite programming
- Regularization methods for semidefinite programming
- Alternating direction augmented Lagrangian methods for semidefinite programming
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming
Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cites Work
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Title not available (Why is that?)
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Sparse inverse covariance estimation with the graphical lasso
- The Schur complement and its applications
- A Singular Value Thresholding Algorithm for Matrix Completion
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Title not available (Why is that?)
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Regularization methods for semidefinite programming
- Exact matrix completion via convex optimization
- Semidefinite Programming
- A coordinate gradient descent method for nonsmooth separable minimization
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- Parallel iterative methods for sparse linear systems
- Title not available (Why is that?)
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- A proximal-based deomposition method for compositions method for convex minimization problems
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Fixed point and Bregman iterative methods for matrix rank minimization
- Second-order cone programming
- A new inexact alternating directions method for monotone variational inequalities
- Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
- Coordinate descent method for large-scale L2-loss linear support vector machines
- Semidefinite optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Local minima and convergence in low-rank semidefinite programming
- Necessary and sufficient conditions for a penalty method to be exact
- Globally convergent block-coordinate techniques for unconstrained optimization
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Title not available (Why is that?)
- A boundary point method to solve semidefinite programs
- A projected gradient algorithm for solving the maxcut SDP relaxation
- Title not available (Why is that?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On search directions for minimization algorithms
- A variable-penalty alternating directions method for convex optimization
- Robust Portfolio Selection Problems
- Solving semidefinite programming problems via alternating direction methods
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Robust convex quadratically constrained programs
- Proximal Decomposition Via Alternating Linearization
- A descent method for structured monotone variational inequalities
- On the convergence of the coordinate descent method for convex differentiable minimization
- Global and uniform convergence of subspace correction methods for some convex optimization problems
- Dual coordinate ascent methods for non-strictly convex minimization
- Title not available (Why is that?)
Cited In (30)
- A half-quadratic block-coordinate descent method for spectral estimation.
- FANOK: knockoffs in linear time
- Title not available (Why is that?)
- Robust discriminative clustering with sparse regularizers
- A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares
- Randomized sparse block Kaczmarz as randomized dual block-coordinate descent
- An alternating minimization method for robust principal component analysis
- An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization
- Multi-label Lagrangian support vector machine with random block coordinate descent method
- A cyclic block coordinate descent method with generalized gradient projections
- Randomized primal-dual proximal block coordinate updates
- Block stochastic gradient iteration for convex and nonconvex optimization
- An efficient inexact ABCD method for least squares semidefinite programming
- On the complexity analysis of randomized block-coordinate descent methods
- Block coordinate descent for smooth nonconvex constrained minimization
- A randomized nonmonotone block proximal gradient method for a class of structured nonlinear programming
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Approximating the little Grothendieck problem over the orthogonal and unitary groups
- Accelerated block-coordinate relaxation for regularized optimization
- Conservative descent for semi-orthogonal decompositions
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- A penalty decomposition method for rank minimization problem with affine constraints
- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Markov chain block coordinate descent
- Phase recovery, MaxCut and complex semidefinite programming
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs
- Global registration of multiple point clouds using semidefinite programming
- Randomized block proximal damped Newton method for composite self-concordant minimization
- On the estimation performance and convergence rate of the generalized power method for phase synchronization
Uses Software
This page was built for publication: Block coordinate descent methods for semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802537)
