A simple method for convex optimization in the oracle model

DOI10.1007/S10107-023-02005-8MaRDI QIDQ6589751FDOQ6589751

Sophie Huiberts, Daniel Dadush, Christopher Hojny, Stefan Weltge

Publication date: 20 August 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

convex optimizationcutting plane methodseparation oracle

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05)

Cites Work

• First-Order Methods in Optimization
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Geometric algorithms and combinatorial optimization
• A new algorithm for minimizing convex functions over convex sets
• Outline of an algorithm for integer solutions to linear programs
• The Cutting-Plane Method for Solving Convex Programs
• Maximum matching and a polyhedron with 0,1-vertices
• Title not available (Why is that?)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• The maximum concurrent flow problem
• Newton's method for convex programming and Tschebyscheff approximation
• Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
• Title not available (Why is that?)
• Linear programming boosting via column generation
• A cutting plane algorithm for convex programming that uses analytic centers
• A simple polynomial-time rescaling algorithm for solving linear programs
• Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
• A strongly polynomial algorithm for linear systems having a binary solution
• Fast Approximation Algorithms for Fractional Packing and Covering Problems
• Title not available (Why is that?)
• Complexity estimates of some cutting plane methods based on the analytic barrier
• An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
• An Efficient Rescaled Perceptron Algorithm for Conic Systems
• An improved cutting plane method for convex optimization, convex-concave games, and its applications
• A simple method for convex optimization in the oracle model
• Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems
• Rescaling Algorithms for Linear Conic Feasibility

This page was built for publication: A simple method for convex optimization in the oracle model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589751)