Access the full text.
Sign up today, get DeepDyve free for 14 days.
G. Gu, M. Zangiabadi, Kees Roos (2011)
Full Nesterov-Todd step infeasible interior-point method for symmetric optimizationEur. J. Oper. Res., 214
Guoqiang Wang, D. Zhu (2011)
A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDONumerical Algorithms, 57
X Yang, H Liu, C Liu (2015)
J. Comput. Appl. Math.
L. Faybusovich (1997)
Euclidean Jordan Algebras and Interior-point AlgorithmsPositivity, 1
L. Tunçel (2001)
Generalization of Primal—Dual Interior-Point Methods to Convex Optimization Problems in Conic FormFoundations of Computational Mathematics, 1
Lu Li, K. Toh (2010)
A polynomial-time inexact interior-point method for convex quadratic symmetric cone programming, 2
C Liu (2012)
Study on Complexity of Some Interior-Point Algorithms in Conic Programming
A. Nemirovski, Kees Roos, T. Terlaky (1999)
On maximization of quadratic form over intersection of ellipsoids with common centerMathematical Programming, 86
MF Anjos, JB Lasserre (2012)
Handbook on Semidefinite, Conic and Polynomial Optimization: Theory, Algorithms, Software and Applications. International Series in Operational Research and Management Science
RDC Monteiro, Y Zhang (1998)
A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programmingMath. Programming, 81
M. Bingham (2006)
Analysis on Symmetric Cones (oxford Mathematical Monographs)
Jiawang Nie, Ya-xiang Yuan (2001)
A Predictor–Corrector Algorithm for QSDP Combining Dikin-Type and Newton Centering StepsAnnals of Operations Research, 103
M. Anjos, J. Lasserre (2012)
Handbook on Semidefinite, Conic and Polynomial OptimizationHandbook on Semidefinite, Conic and Polynomial Optimization
Yanqin Bai, Lipu Zhang (2011)
A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimizationJournal of Industrial and Management Optimization, 7
W Ai, S Zhang (2005)
An O( $$\sqrt nL$$ ) iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCPSIAM J. Optim., 16
GQ Wang, CJ Yu, KL Teo (2013)
A new full Nesterov-Todd step feasible interior-point method for convex quadratic optimization over symmetric coneAppl. Math. Comput., 221
G. Wang, Y. Bai (2009)
Primal-dual interior-point algorithm for convex quadratic semi-definite optimizationNonlinear Analysis-theory Methods & Applications, 71
R. Monteiro, Yin Zhang (1998)
A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programmingMathematical Programming, 81
Y. Baiy, M. Roosz (2001)
Òòû Ae Blockin Blockin
R. Monteiro, I. Adler (1989)
Interior path following primal-dual algorithms. part II: Convex quadratic programmingMathematical Programming, 44
G. Gu, M. Zangiabadi, And Roos (2008)
FULL NESTEROV-TODD STEP INTERIOR-POINT METHODS FOR SYMMETRIC OPTIMIZATION
KC Toh (2008)
An inexact primal-dual path following algorithm for convex quadratic SDPMath. Program. Ser. B, 112
B. Rangarajan (2006)
Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric ConesSIAM J. Optim., 16
H. Upmeier (1996)
ANALYSIS ON SYMMETRIC CONES (Oxford Mathematical Monographs)Bulletin of The London Mathematical Society, 28
Guoqiang Wang, Changjun Yu, K. Teo (2013)
A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimizationAppl. Math. Comput., 221
Gu-liang Wang, Zhanyue Zhang, D. Zhu (2013)
Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone OptimizationNumerical Functional Analysis and Optimization, 34
M. Frei (2016)
Analysis On Symmetric Cones
GQ Wang, ZH Zhang, DT Zhu (2013)
On extending primal-dual interior-point method for linear optimization to convex quadratic symmetric cone optimizationNumer. Fund. Anal. Optim., 34
YQ Bai (2003)
10.1137/S1052623401398132SIAM J. Optim., 13
S. Schmieta, F. Alizadeh (2003)
Extension of primal-dual interior point algorithms to symmetric conesMathematical Programming, 96
Ximei Yang, Hongwei Liu, Changhe Liu (2015)
A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimizationJ. Comput. Appl. Math., 283
Y. Nesterov, M. Todd (1997)
Self-Scaled Barriers and Interior-Point Methods for Convex ProgrammingMath. Oper. Res., 22
L. Faybusovich (2002)
A Jordan-algebraic approach to potential-reduction algorithmsMathematische Zeitschrift, 239
Hongwei Liu, Ximei Yang, Changhe Liu (2013)
A New Wide Neighborhood Primal–Dual Infeasible-Interior-Point Method for Symmetric Cone ProgrammingJournal of Optimization Theory and Applications, 158
Wenbao Ai, Shuzhong Zhang (2005)
An O(\sqrtn L) Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCPSIAM J. Optim., 16
YQ Bai, MEl Ghami (2003)
A new effcient large-update primal-dual interior- point method based on a nite barrierSIAM J. Optim., 13
Osman Güler (1996)
Barrier Functions in Interior Point MethodsMath. Oper. Res., 21
KC Toh (2008)
10.1007/s10107-006-0088-yMath. Program. Ser. B, 112
L Tuncel (2001)
Generalization of primal-dual interior-point methods to convex optimization problems in conic form. FoundComput. Math., 1
In this paper, we present a neighborhood following primal-dual interior-point algorithm for solving symmetric cone convex quadratic programming problems, where the objective function is a convex quadratic function and the feasible set is the intersection of an affine subspace and a symmetric cone attached to a Euclidean Jordan algebra. The algorithm is based on the [13] broad class of commutative search directions for cone of semidefinite matrices, extended by [18] to arbitrary symmetric cones. Despite the fact that the neighborhood is wider, which allows the iterates move towards optimality with longer steps, the complexity iteration bound remains as the same result of Schmieta and Alizadeh for symmetric cone optimization problems.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: May 15, 2019
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.