Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 229,870,624 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
A Library for Support Vector Machines
Adaptive coordinate descent
Algorithm
Derivative-free optimization
Expand
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
A. Cirik
,
Miltiades Filippou
,
T. Ratnarajah
IEEE Transactions on Cognitive Communications and…
2016
Corpus ID: 11490788
In this paper, the operation of a full-duplex (FD) multiple-input multiple-output (MIMO) underlay cognitive radio (CR) network is…
Expand
2015
2015
Fix-and-relax approaches for controlled tabular adjustment
Daniel Baena
,
J. Castro
,
José A. González
Computers & Operations Research
2015
Corpus ID: 17816644
2015
2015
Fast GPU-Driven Model-Based X-Ray CT Image Reconstruction via Alternating Dual Updates
Madison G. McGaffin
,
J. Fessler
2015
Corpus ID: 2818811
Model-based image reconstruction (MBIR) methods for X-ray CT reconstruction can improve image quality and reduce patient X-ray…
Expand
2014
2014
Robust Block Coordinate Descent
K. Fountoulakis
,
R. Tappenden
2014
Corpus ID: 119116829
In this paper we present a novel randomized block coordinate descent method for the minimization of a convex composite objective…
Expand
2012
2012
Simulation-based optimization algorithms with applications to dynamic spectrum access
N. Hegde
,
Alexandre Proutière
Annual Conference on Information Sciences and…
2012
Corpus ID: 12395598
Wireless systems operating on the unlicensed part of the radio spectrum (e.g. WiFi and their evolutions) must share a…
Expand
2010
2010
Adaptive Compensation of Multimode Fiber Dispersion by Control of Launched Amplitude, Phase, and Polarization
M. B. Shemirani
,
J. Wilde
,
J. Kahn
Journal of Lightwave Technology
2010
Corpus ID: 14512256
In previous work, we studied the compensation of modal dispersion in multimode fiber (MMF) using several different configurations…
Expand
Highly Cited
2009
Highly Cited
2009
Tree Block Coordinate Descent for MAP in Graphical Models
D. Sontag
,
T. Jaakkola
International Conference on Artificial…
2009
Corpus ID: 8154566
A number of linear programming relaxations have been proposed for finding most likely settings of the variables (MAP) in large…
Expand
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…
Expand
1990
1990
Relaxation methods for monotropic programs
P. Tseng
,
D. Bertsekas
Mathematical programming
1990
Corpus ID: 1060464
We propose a dual descent method for the problem of minimizing a convex, possibly nondifferentiable, separable cost subject to…
Expand
1953
1953
Studies in coordinate indexing
M. Taube
1953
Corpus ID: 60243350
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)
ACCEPT & CONTINUE