Set-limited functions and polynomial-time interior-point methods

DOI10.1007/S10957-023-02163-XMaRDI QIDQ6596326zbMATH OpenFDO

Authors Yuri Nesterov

Publication date 2 September 2024

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10957-023-02163-X

zbMATH Keywords

convex optimizationinterior-point methodspolynomial-time methodsself-concordant functions

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• Interior-point methods for convex programming
• scientific article; zbMATH DE number 729680
• A polynomial-time interior-point algorithm based on a local self-concordant finite barrier function
• Self-regular functions and new search directions for linear and semidefinite optimization
• On self-concordant convex–concave functions

Cites work

• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Accelerated regularized Newton methods for minimizing composite convex functions
• Accelerating the cubic regularization of Newton's method on convex problems
• Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
• Advances in convex optimization: conic programming
• An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
• Complexity bounds for second-order optimality in unconstrained optimization
• Cubic regularization of Newton method and its global performance
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Introductory lectures on convex optimization. A basic course.
• Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems
• Path-Following Methods for Linear Programming
• Smooth minimization of non-smooth functions
• Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models

Cited in

(1)

• Accelerated adaptive cubic regularized quasi-Newton methods

This page was built for publication: Set-limited functions and polynomial-time interior-point methods

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