Block Coordinate Descent Methods for Semidefinite Programming (Q2802537)

From MaRDI portal

Revision as of 20:33, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Block Coordinate Descent Methods for Semidefinite Programming	scientific article

Statements

scholarly article

0 references

Block Coordinate Descent Methods for Semidefinite Programming (English)

0 references

0 references

Donald Goldfarb

0 references

Katya Scheinberg

0 references

International Series in Operations Research & Management Science

0 references

publication date

26 April 2016

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-1-4614-0769-0_19

0 references

Second-order cone programming

0 references

0 references

Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization

0 references

Necessary and sufficient conditions for a penalty method to be exact

0 references

0 references

0 references

0 references

0 references

Optimizing a polyhedral-semidefinite relaxation of completely positive programs

0 references

A projected gradient algorithm for solving the maxcut SDP relaxation

0 references

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

0 references

Local minima and convergence in low-rank semidefinite programming

0 references

Solving Lift-and-Project Relaxations of Binary Integer Programs

0 references

Exact matrix completion via convex optimization

0 references

0 references

A proximal-based deomposition method for compositions method for convex minimization problems

0 references

0 references

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

0 references

Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization

0 references

0 references

Sparse inverse covariance estimation with the graphical lasso

0 references

Exploiting sparsity in primal-dual interior-point methods for semidefinite programming

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Robust convex quadratically constrained programs

0 references

Robust Portfolio Selection Problems

0 references

Globally convergent block-coordinate techniques for unconstrained optimization

0 references

On the convergence of the block nonlinear Gauss-Seidel method under convex constraints

0 references

0 references

A new inexact alternating directions method for monotone variational inequalities

0 references

Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities

0 references

A Spectral Bundle Method for Semidefinite Programming

0 references

A Singular Value Thresholding Algorithm for Matrix Completion

0 references

Proximal Decomposition Via Alternating Linearization

0 references

0 references

A variable-penalty alternating directions method for convex optimization

0 references

Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm

0 references

On the convergence of the coordinate descent method for convex differentiable minimization

0 references

Fixed point and Bregman iterative methods for matrix rank minimization

0 references

Regularization Methods for Semidefinite Programming

0 references

A boundary point method to solve semidefinite programs

0 references

On search directions for minimization algorithms

0 references

Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming

0 references

0 references

Global and uniform convergence of subspace correction methods for some convex optimization problems

0 references

Semidefinite optimization

0 references

Dual coordinate ascent methods for non-strictly convex minimization

0 references

Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities

0 references

Convergence of a block coordinate descent method for nondifferentiable minimization

0 references

Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization

0 references

A coordinate gradient descent method for nonsmooth separable minimization

0 references

Semidefinite Programming

0 references

A New Alternating Minimization Algorithm for Total Variation Image Reconstruction

0 references

Alternating direction augmented Lagrangian methods for semidefinite programming

0 references

Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm

0 references

Handbook of semidefinite programming. Theory, algorithms, and applications

0 references

A descent method for structured monotone variational inequalities

0 references

Solving semidefinite programming problems via alternating direction methods

0 references

The Schur complement and its applications

0 references

A Newton-CG Augmented Lagrangian Method for Semidefinite Programming

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-1-4614-0769-0_19

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2802537

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2802537&oldid=36245009"