An exterior point polynomial-time algorithm for convex quadratic programming

被引：6

作者：

Tian, Da Gang ^{[1
]}

机构：

[1] Shanghai Univ Sci & Technol, Sch Business, Shanghai, Peoples R China

来源：

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS | 2015年 / 61卷 / 01期

关键词：

Self-concordant function; Polynomial-time algorithm; Exterior point; Path-following; Convex quadratic programming; Regularization; NONLINEAR RESCALING METHOD; PATH-FOLLOWING ALGORITHM; COMPLEMENTARITY-PROBLEMS; SMOOTHING TECHNIQUE; NEWTON METHOD; LARGE-SCALE; CONVERGENCE; REDUCTION;

D O I：

10.1007/s10589-014-9710-8

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper an exterior point polynomial time algorithm for convex quadratic programming problems is proposed. We convert a convex quadratic program into an unconstrained convex program problem with a self-concordant objective function. We show that, only with duality, the Path-following method is valid. The computational complexity analysis of the algorithm is given.

引用

页码：51 / 78

页数：28

共 50 条

[21] A polynomial predictor-corrector interior-point algorithm for convex quadratic programming with box constraints on variables
Liu, Chunling
Bai, Qinxi
Wang, Maobo
INFORMATION, MANAGEMENT AND ALGORITHMS, VOL II, 2007, : 208 - 213
[22] An interior-exterior approach for convex quadratic programming
El Yassini, Khalid
Ben Ali, Safae El Haj
APPLIED NUMERICAL MATHEMATICS, 2012, 62 (09) : 1139 - 1155
[23] An exterior newton method for strictly convex quadratic programming
Coleman, TF
Liu, JG
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2000, 15 (01) : 5 - 32
[24] An Exterior Newton Method for Strictly Convex Quadratic Programming
Thomas F. Coleman
Jianguo Liu
Computational Optimization and Applications, 2000, 15 : 5 - 32
[25] A SIMPLE COMPLEXITY PROOF FOR A POLYNOMIAL-TIME LINEAR-PROGRAMMING ALGORITHM
TSENG, P
OPERATIONS RESEARCH LETTERS, 1989, 8 (03) : 155 - 159
[26] A Polynomial-Time Custom Instruction Identification Algorithm Based on Dynamic Programming
Ahn, Junwhan
Lee, Imyong
Choi, Kiyoung
2011 16TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC), 2011,
[27] A POLYNOMIAL-TIME ALGORITHM, BASED ON NEWTON METHOD, FOR LINEAR-PROGRAMMING
RENEGAR, J
MATHEMATICAL PROGRAMMING, 1988, 40 (01) : 59 - 93
[28] A RANDOM POLYNOMIAL-TIME ALGORITHM FOR WELL-ROUNDING CONVEX-BODIES
FAIGLE, U
GADEMANN, N
KERN, W
DISCRETE APPLIED MATHEMATICS, 1995, 58 (02) : 117 - 144
[29] An interior point algorithm for convex quadratic programming with strict equilibrium constraints
Benouahboun, R
Mansouri, A
RAIRO-OPERATIONS RESEARCH, 2005, 39 (01) : 13 - 33
[30] A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints
Kumar, T. K. Satish
Duc Thien Nguyen
Yeoh, William
Koenig, Sven
PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2014, : 2308 - 2314

← 1 2 3 4 5 →