Image de couverture de livre

On the Curvature of the Central Path of Linear Programming Theory

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dedieu, Jean-Pierre, Malajovich, Gregorio, Shub, Mike
Format:	Preprint
Publié:	2003
Sujets:	Optimization and Control Numerical Analysis 90C51 (Primary); 90C60,68Q25,65H10 (Secondary)
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Optimization in Theory and Practice
par: Wright, Stephen J.
Publié: (2025)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
par: Zhang, Chenyu, et autres
Publié: (2023)

Grassmannian optimization is NP-hard
par: Lai, Zehua, et autres
Publié: (2024)

A semidefinite programming characterization of the Crawford number
par: Friedland, Shmuel, et autres
Publié: (2024)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
par: Hua, Zheng, et autres
Publié: (2021)

On semidefinite programming characterizations of the numerical radius and its dual norm
par: Friedland, Shmuel, et autres
Publié: (2023)

Restarts subject to approximate sharpness: A parameter-free and optimal scheme for first-order methods
par: Adcock, Ben, et autres
Publié: (2023)

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

A practical randomized trust-region method to escape saddle points in high dimension
par: Dragomir, Radu-Alexandru, et autres
Publié: (2026)

An adaptive framework for first-order gradient methods
par: Hu, Xiaozhe, et autres
Publié: (2026)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
par: Mohammadisiahroudi, Mohammadhossein, et autres
Publié: (2023)

A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms
par: Yoon, TaeHo, et autres
Publié: (2026)

Dimension-free estimators of gradients of functions with(out) non-independent variables
par: Lamboni, Matieyendou
Publié: (2025)

Barrier Algorithms for Constrained Non-Convex Optimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

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

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
par: Nesterov, Yurii
Publié: (2025)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
par: Ouyang, Wenqing, et autres
Publié: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
par: Ouyang, Wenqing
Publié: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
par: Zhang, Liwei, et autres
Publié: (2025)

Accelerating preconditioned ADMM via degenerate proximal point mappings
par: Sun, Defeng, et autres
Publié: (2024)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
par: Bousselmi, Nizar, et autres
Publié: (2023)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
par: Curtis, Frank E., et autres
Publié: (2025)

A Proximal-Gradient Method for Constrained Optimization
par: Dai, Yutong, et autres
Publié: (2024)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
par: Bot, Radu Ioan, et autres
Publié: (2024)

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
par: He, Chuan, et autres
Publié: (2023)

A User Manual for cuHALLaR: A GPU Accelerated Low-Rank Semidefinite Programming Solver
par: Aguirre, Jacob, et autres
Publié: (2025)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
par: Aguirre, Jacob M., et autres
Publié: (2025)

Criticality measure-based error estimates for infinite dimensional optimization
par: Li, Danlin, et autres
Publié: (2024)

Long-Step Path-Following Algorithm for Quantum Information Theory: Some Numerical Aspects and Applications
par: Faybusovich, Leonid, et autres
Publié: (2019)

On the Hardness of Short and Sign-Compatible Circuit Walks
par: Borgwardt, Steffen, et autres
Publié: (2024)

The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm
par: Ye, Yuhan, et autres
Publié: (2026)

Analysis of Kernel Mirror Prox for Measure Optimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

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

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
par: Sujanani, Arnesh, et autres
Publié: (2024)

Computational complexity of sum-of-squares bounds for copositive programs
par: Palomba, Marilena, et autres
Publié: (2025)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
par: Bao, Chenglong, et autres
Publié: (2024)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
par: Rubbens, Anne, et autres
Publié: (2024)

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

New complexity bounds for primal--dual interior-point algorithms in conic optimization
par: Dahl, Joachim, et autres
Publié: (2025)

Gaussian smoothing gradient descent for minimizing functions (GSmoothGD)
par: Starnes, Andrew, et autres
Publié: (2023)