Skip to search formSkip to main contentSkip to account menu

Coordinate descent

Known as: Coordinate (disambiguation), Coordinate ascent 
Coordinate descent is a derivative-free optimization algorithm. To find a local minimum of a function, one does line search along one coordinate… 
Wikipedia (opens in a new tab)

Related topics

Related topics

23 relations
A Library for Support Vector MachinesAdaptive coordinate descentAlgorithmDerivative-free optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Transceiver Design in Full-Duplex MIMO Cognitive Radios Under Channel Uncertainties
In this paper, the operation of a full-duplex (FD) multiple-input multiple-output (MIMO) underlay cognitive radio (CR) network is… 
2015
2015
Fix-and-relax approaches for controlled tabular adjustment
2015
2015
Fast GPU-Driven Model-Based X-Ray CT Image Reconstruction via Alternating Dual Updates
Model-based image reconstruction (MBIR) methods for X-ray CT reconstruction can improve image quality and reduce patient X-ray… 
2014
2014
Robust Block Coordinate Descent
In this paper we present a novel randomized block coordinate descent method for the minimization of a convex composite objective… 
Highly Cited
2009
Highly Cited
2009
Tree Block Coordinate Descent for MAP in Graphical Models
A number of linear programming relaxations have been proposed for finding most likely settings of the variables (MAP) in large… 
2009
2009
Optimization of Structured Mean Field Objectives
In intractable, undirected graphical models, an intuitive way of creating structured mean field approximations is to select an… 
2004
2004
Boosting Based on a Smooth Margin
We study two boosting algorithms, Coordinate Ascent Boosting and Approximate Coordinate Ascent Boosting, which are explicitly… 
Highly Cited
1997
Highly Cited
1997
Grouped coordinate descent algorithms for robust edge-preserving image restoration
  • J. Fessler
  • Optics & Photonics
  • 1997
  • Corpus ID: 16901515
We present a new class of algorithms for edge-preserving restoration of piecewise-smooth images measured in non- Gaussian noise… 
1990
1990
Relaxation methods for monotropic programs
We propose a dual descent method for the problem of minimizing a convex, possibly nondifferentiable, separable cost subject to… 
1953
1953
Studies in coordinate indexing
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)