Related references
Note: Only part of the references are listed.A wide neighborhood interior-point algorithm with arc-search for P*(κ) linear complementarity problem
Beibei Yuan et al.
APPLIED NUMERICAL MATHEMATICS (2019)
A primal-dual interior-point algorithm with arc-search for semidefinite programming
Mingwang Zhang et al.
OPTIMIZATION LETTERS (2019)
QPLIB: a library of quadratic programming instances
Fabio Furini et al.
MATHEMATICAL PROGRAMMING COMPUTATION (2019)
An arc-search O(nL) infeasible-interior-point algorithm for linear programming
Yaguang Yang et al.
OPTIMIZATION LETTERS (2018)
An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones
Mohammad Pirhaji et al.
MATHEMATICAL MODELLING AND ANALYSIS (2018)
Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
Y. Yang
NUMERICAL ALGORITHMS (2018)
CurveLP-A MATLAB implementation of an infeasible interior-point algorithm for linear programming
Yaguang Yang
NUMERICAL ALGORITHMS (2017)
A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
Ximei Yang et al.
JOURNAL OF INEQUALITIES AND APPLICATIONS (2017)
A wide neighborhood infeasible-interior-point method with arc-search for linear programming
Ximei Yang et al.
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING (2016)
A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
G. Q. Wang et al.
APPLIED MATHEMATICS AND COMPUTATION (2013)
A library for continuous convex separable quadratic knapsack problems
Antonio Frangioni et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2013)
A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming
Yaguang Yang
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2013)
Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
Xinzhong Cai et al.
NUMERICAL ALGORITHMS (2013)
Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization
G. Q. Wang et al.
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION (2013)
A polynomial arc-search interior-point algorithm for convex quadratic programming
Yaguang Yang
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2011)
A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
Guoqiang Wang et al.
NUMERICAL ALGORITHMS (2011)
AN AFFINE-SCALING INTERIOR-POINT METHOD FOR CONTINUOUS KNAPSACK CONSTRAINTS WITH APPLICATION TO SUPPORT VECTOR MACHINES
Maria D. Gonzalez-Lima et al.
SIAM JOURNAL ON OPTIMIZATION (2011)
A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
G. Q. Wang et al.
APPLIED MATHEMATICS AND COMPUTATION (2009)
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
YH Dai et al.
MATHEMATICAL PROGRAMMING (2006)
A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
Q Yu et al.
ACTA MATHEMATICA SCIENTIA (2006)
An improved gradient projection-based decomposition technique for support vector machines
Luca Zanni
COMPUTATIONAL MANAGEMENT SCIENCE (2006)
Interior-point solver for large-scale quadratic programming problems with bound constraints
S. Cafieri et al.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2006)
An iterative solver-based infeasible primal-dual path-following algorithm for convex quadratic programming
Zhaosong Lu et al.
SIAM JOURNAL ON OPTIMIZATION (2006)
Self-regular functions and new search directions for linear and semidefinite optimization
JM Peng et al.
MATHEMATICAL PROGRAMMING (2002)
A predictor-corrector algorithm for QSDP combining Dikin-type and Newton centering steps
JW Nie et al.
ANNALS OF OPERATIONS RESEARCH (2001)
A potential reduction algorithm for an extended SDP problem
JW Nie et al.
SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY (2000)
Share Paper
