A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization-Reference-Cited by-同舟云学术

A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization

Published:2010-07 Issue:3 Volume:44 Page:251-265
ISSN:0399-0559
Container-title:RAIRO - Operations Research
language:
Short-container-title:RAIRO-Oper. Res.

Author:

Bai Y. Q.,Wang F. Y.,Luo X. W.

Publisher

EDP Sciences

Subject

Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science

Link

http://www.rairo-ro.org/10.1051/ro/2010016/pdf

Reference22 articles.

1. A new primal-dual path-following method for convex quadratic programming

2. I. Adler and F. Alizadeh,Primal-dual interior point algorithms for convex quadratically constrained and semidefinite optimization problems.Technical Report RRR-111-95, Rutger Center for Operations Research, Brunswick, NJ (1995).

3. Primal-dual Interior-point Algorithms for Second-order Cone Optimization Based on a New Parametric Kernel Function

4. A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation;Optimization Letters;2020-06-24

2. Complexity analysis of a full-Newton step interior-point method for linear optimization;Periodica Mathematica Hungarica;2016-03-19

3. A method for weighted projections to the positive definite cone;Optimization;2014-06-24

4. A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION;Asian-European Journal of Mathematics;2014-03

5. A Large-Update Feasible Interior-Point Algorithm for Convex Quadratic Semi-definite Optimization Based on a New Kernel Function;Journal of the Operations Research Society of China;2013-09