The condition number of a function relative to a set

DOI10.1007/s10107-020-01510-4zbMath1470.90077arXiv1901.08359OpenAlexW3023412291MaRDI QIDQ2039239

David H. Gutman, Javier F. Peña

Publication date: 2 July 2021

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

Full work available at URL: https://arxiv.org/abs/1901.08359

Mathematics Subject Classification ID

Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Methods of reduced gradient type (90C52)

Related Items (4)

Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning ⋮ Generalized self-concordant analysis of Frank-Wolfe algorithms ⋮ Faster first-order primal-dual methods for linear programming using restarts and sharpness ⋮ Frank-Wolfe and friends: a journey into projection-free first-order optimization methods

Cites Work

• Gradient methods for minimizing composite functions
• Introductory lectures on convex optimization. A basic course.
• Complexity of convex optimization using geometry-based measures and a reference point
• Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
• A simplified view of first order methods for optimization
• A conditional gradient method with linear rate of convergence for solving convex linear systems
• Linear programming, complexity theory and elementary functional analysis
• New characterizations of Hoffman constants for systems of linear constraints
• Enhanced basic procedures for the projection and rescaling algorithm
• Linearly convergent away-step conditional gradient for non-strongly convex functions
• Linear convergence of first order methods for non-strongly convex optimization
• Ill-Conditioned Convex Processes and Conic Linear Systems
• A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems
• Towards a deeper geometric, analytic and algorithmic understanding of margins
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Some comments on Wolfe's ‘away step’
• Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
• An Optimal First Order Method Based on Optimal Quadratic Averaging
• Relatively Smooth Convex Optimization by First-Order Methods, and Applications
• Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
• The radius of metric regularity
• Incorporating Condition Measures into the Complexity Theory of Linear Programming
• Understanding the Geometry of Infeasible Perturbations of a Conic Linear System
• Polytope Conditioning and Linear Convergence of the Frank–Wolfe Algorithm
• A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
• A new condition number for linear programming

This page was built for publication: The condition number of a function relative to a set