Cover Image

On the Curvature of the Central Path of Linear Programming Theory

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dedieu, Jean-Pierre, Malajovich, Gregorio, Shub, Mike
Format:	Preprint
Published:	2003
Subjects:	Optimization and Control Numerical Analysis 90C51 (Primary); 90C60,68Q25,65H10 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimization in Theory and Practice
by: Wright, Stephen J.
Published: (2025)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
by: Zhang, Chenyu, et al.
Published: (2023)

Grassmannian optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2024)

A semidefinite programming characterization of the Crawford number
by: Friedland, Shmuel, et al.
Published: (2024)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
by: Hua, Zheng, et al.
Published: (2021)

On semidefinite programming characterizations of the numerical radius and its dual norm
by: Friedland, Shmuel, et al.
Published: (2023)

Restarts subject to approximate sharpness: A parameter-free and optimal scheme for first-order methods
by: Adcock, Ben, et al.
Published: (2023)

On semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices
by: Friedland, Shmuel
Published: (2023)

A practical randomized trust-region method to escape saddle points in high dimension
by: Dragomir, Radu-Alexandru, et al.
Published: (2026)

An adaptive framework for first-order gradient methods
by: Hu, Xiaozhe, et al.
Published: (2026)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
by: Mohammadisiahroudi, Mohammadhossein, et al.
Published: (2023)

A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms
by: Yoon, TaeHo, et al.
Published: (2026)

Dimension-free estimators of gradients of functions with(out) non-independent variables
by: Lamboni, Matieyendou
Published: (2025)

Barrier Algorithms for Constrained Non-Convex Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
by: Monteiro, Renato D. C., et al.
Published: (2024)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
by: Nesterov, Yurii
Published: (2025)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
by: Ouyang, Wenqing, et al.
Published: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
by: Ouyang, Wenqing
Published: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
by: Zhang, Liwei, et al.
Published: (2025)

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
by: Bousselmi, Nizar, et al.
Published: (2023)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
by: Curtis, Frank E., et al.
Published: (2025)

A Proximal-Gradient Method for Constrained Optimization
by: Dai, Yutong, et al.
Published: (2024)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
by: He, Chuan, et al.
Published: (2023)

A User Manual for cuHALLaR: A GPU Accelerated Low-Rank Semidefinite Programming Solver
by: Aguirre, Jacob, et al.
Published: (2025)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
by: Aguirre, Jacob M., et al.
Published: (2025)

Criticality measure-based error estimates for infinite dimensional optimization
by: Li, Danlin, et al.
Published: (2024)

Long-Step Path-Following Algorithm for Quantum Information Theory: Some Numerical Aspects and Applications
by: Faybusovich, Leonid, et al.
Published: (2019)

On the Hardness of Short and Sign-Compatible Circuit Walks
by: Borgwardt, Steffen, et al.
Published: (2024)

The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm
by: Ye, Yuhan, et al.
Published: (2026)

Analysis of Kernel Mirror Prox for Measure Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Incremental Certificate Learning for Hybrid Neural Network Verification . A Solver Architecture for Piecewise-Linear Safety Queries
by: Gokavarapu, Chandrasekhar
Published: (2025)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
by: Sujanani, Arnesh, et al.
Published: (2024)

Computational complexity of sum-of-squares bounds for copositive programs
by: Palomba, Marilena, et al.
Published: (2025)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
by: Bao, Chenglong, et al.
Published: (2024)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
by: Rubbens, Anne, et al.
Published: (2024)

A polynomial time infeasible interior-point arc-search algorithm for convex optimization
by: Yang, Yaguang
Published: (2022)

New complexity bounds for primal--dual interior-point algorithms in conic optimization
by: Dahl, Joachim, et al.
Published: (2025)

Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
by: Starnes, Andrew, et al.
Published: (2023)