Interior-point methods: An old and new approach to nonlinear programming

被引：15

作者：

Nesterov, Y

机构：

[1] Ctr. Operations Res. and Economet., Univ. Catholique de Louvain, 1348 Louvain-la-Neuve

来源：

MATHEMATICAL PROGRAMMING | 1997年 / 79卷 / 1-3期

关键词：

interior point methods; convex programming; complexity;

D O I：

10.1007/BF02614321

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In this paper we discuss the main concepts of structural optimization, a field of nonlinear programming, which was formed by the intensive development of modem interior-point schemes. (C) 1997 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

引用

页码：285 / 297

页数：13

共 32 条

[1]

[Anonymous], 1979, Soviet Math. Dokl

[2]

[Anonymous], 1972, COMPLEXITY COMPUTER

[3] On long step path following and SUMT for linear and quadratic programming [J].