On convex optimization with linear constraints
type: Item
instance of: scholarly article
title: On convex optimization with linear constraints
zbMATH Open document ID: 0838.90096
DOI: 10.1007/BF02192087
author: Yanyan Li
published in: Journal of Optimization Theory and Applications
publication date: 1996-01-16T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 834541
zbMATH Keywords: Newton's method
zbMATH Keywords: method of centers
zbMATH Keywords: interior-point method
zbMATH Keywords: fast rate of convergence
MaRDI profile type: Publication
cites work: Q5187067
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Q4739659
cites work: On some efficient interior point methods for nonlinear convex programming
cites work: Q4435806
cites work: A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
full work available at URL: https://doi.org/10.1007/bf02192087
OpenAlex ID: W1990853333
description: scientific article; zbMATH DE number 834541