Amanote Research

Amanote Research

    RegisterSign In

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems

SIAM Journal on Optimization - United States
doi 10.1137/100802001
Full Text
Open PDF
Abstract

Available in full text

Categories
Theoretical Computer ScienceSoftware
Date

January 1, 2012

Authors
Yu. Nesterov
Publisher

Society for Industrial & Applied Mathematics (SIAM)


Related search

A Stochastic Coordinate Descent for Bound Constrained Global Optimization

2019English

A Dual Coordinate Descent Method for Large-Scale Linear SVM

2008English

Semi-Stochastic Coordinate Descent

Optimization Methods and Software
ControlApplied MathematicsOptimizationSoftware
2017English

SparseNet: Coordinate Descent With Nonconvex Penalties

Journal of the American Statistical Association
UncertaintyStatisticsProbability
2011English

Graph Partitioning-Based Coordination Methods for Large-Scale Multidisciplinary Design Optimization Problems

2012English

A Modification of Steepest Descent Method for Solving Large-Scaled Unconstrained Optimization Problems

International Journal of Engineering and Technology(UAE)
ArchitectureHardwareEngineeringChemical EngineeringBiotechnologyEnvironmental EngineeringComputer Science
2018English

Antenna Array Pattern Synthesis via Coordinate Descent Method

Journal of Electromagnetic Analysis and Applications
2015English

Modified Lagrangian Methods for Separable Optimization Problems

Abstract and Applied Analysis
Applied MathematicsAnalysis
2012English

Convex Methods for Rank-Constrained Optimization Problems

2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy