Set-limited functions and polynomial-time interior-point methods
type: Item
instance of: scholarly article
title: Set-limited functions and polynomial-time interior-point methods
author: Yuri Nesterov
published in: Journal of Optimization Theory and Applications
publication date: 2024-09-02T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 7904918
zbMATH Keywords: convex optimization
zbMATH Keywords: interior-point methods
zbMATH Keywords: self-concordant functions
zbMATH Keywords: polynomial-time methods
MaRDI profile type: Publication
cites work: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
cites work: Q4821526
cites work: Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
cites work: Complexity bounds for second-order optimality in unconstrained optimization
cites work: Path-Following Methods for Linear Programming
cites work: Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions
cites work: A new polynomial-time algorithm for linear programming
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
cites work: Q5421709
cites work: Q3967358
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Smooth minimization of non-smooth functions
cites work: Accelerating the cubic regularization of Newton's method on convex problems
cites work: Q4324980
cites work: Cubic regularization of Newton method and its global performance
cites work: Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems
DOI: 10.1007/S10957-023-02163-X
description: scientific article; zbMATH DE number 7904918