An update-and-stabilize framework for the minimum-norm-point problem

DOI10.1007/S10107-024-02077-0MaRDI QIDQ7019069zbMATH OpenFDO

Authors Satoru Fujishige, Tomonari Kitahara, László A. Végh

Publication date 5 March 2025

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10107-024-02077-0

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Convex programming (90C25)

Cites work

• A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
• A direct method for sparse least squares problems with lower and upper bounds
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
• A primal-dual interior point method whose running time depends only on the constraint matrix
• A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
• A strictly improving linear programming Phase I algorithm
• A strongly polynomial minimum cost circulation algorithm
• A submodular function minimization algorithm based on the minimum-norm base
• Circuit Imbalance Measures and Linear Programming
• Finding the nearest point in A polytope
• scientific article; zbMATH DE number 3915531 (Why is no real title available?)
• scientific article; zbMATH DE number 852525 (Why is no real title available?)
• scientific article; zbMATH DE number 3290885 (Why is no real title available?)
• scientific article; zbMATH DE number 3365043 (Why is no real title available?)
• Learning with submodular functions: a convex optimization perspective
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• Linear convergence of first order methods for non-strongly convex optimization
• Numerical Optimization
• On the Numerical Solution of Constrained Least-Squares Problems
• Revisiting Tardos's framework for linear programming: faster exact solutions using approximate solvers
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
• Zonotopes and the LP-Newton method

Cited in

(1)

• A first order method for linear programming parameterized by circuit imbalance

This page was built for publication: An update-and-stabilize framework for the minimum-norm-point problem

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