Accuracy certificates for convex minimization with inexact oracle

DOI10.1007/s10957-024-02599-9MaRDI QIDQ6661688

A. V. Gasnikov, Unnamed Author, Pavel Dvurechensky

Publication date: 13 January 2025

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

convex optimizationprimal-dual algorithmscutting plane methodsinexact subgradientaccuracy certificate

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient numerical methods for entropy-linear programming problems
• Lectures on convex optimization
• Minimum-volume enclosing ellipsoids and core sets
• On the complexity of approximating the maximal inscribed ellipsoid for a polytope
• A new algorithm for minimizing convex functions over convex sets
• A cutting plane algorithm for convex programming that uses analytic centers
• On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
• Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization
• Accuracy Certificates for Computational Problems with Convex Structure
• On Vaidya's Volumetric Cutting Plane Method for Convex Programming
• On self-concordant convex–concave functions
• Improved Complexity for Maximum Volume Inscribed Ellipsoids
• A Deterministic Linear Program Solver in Current Matrix Multiplication Time
• Location of the Maximum on Unimodal Surfaces
• Subgradient ellipsoid method for nonsmooth convex problems

This page was built for publication: Accuracy certificates for convex minimization with inexact oracle