An Optimal Algorithm for Constrained Differentiable Convex Optimization

DOI10.1137/110836602zbMath1288.65087OpenAlexW2074703455MaRDI QIDQ5408206

Diane R. Rossetto, Elizabeth W. Karas, Clóvis C. Gonzaga

Publication date: 9 April 2014

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110836602

zbMATH Keywords

complexityalgorithmnumerical experimentconstrained convex optimizationoptimal method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Complexity and performance of numerical algorithms (65Y20)

Related Items (7)

An adaptive accelerated first-order method for convex optimization ⋮ OSGA: a fast subgradient algorithm with optimal complexity ⋮ An optimal subgradient algorithm with subspace search for costly convex optimization problems ⋮ Optimal subgradient algorithms for large-scale convex optimization in simple domains ⋮ Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) ⋮ Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity ⋮ Incremental accelerated gradient methods for SVM classification: study of the constrained approach

This page was built for publication: An Optimal Algorithm for Constrained Differentiable Convex Optimization