Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
DOI10.1007/S11075-012-9581-YzbMATH Open1260.65053OpenAlexW2020971083MaRDI QIDQ1935397FDOQ1935397
Authors: Xin-Zhong Cai, Guoqiang Wang, Zihou Zhang 
Publication date: 15 February 2013
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-012-9581-y
Recommendations
- A new primal-dual interior-point algorithm for convex quadratic optimization
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- Properties Of Primal Interior Point Methods For QP∗
- A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
algorithmsnumerical examplesiteration boundprimal-dual interior-point methodsKernel functionconvex quadratic optimizationlarge- and small-update methods
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Interior-point methods (90C51)
Cites Work
- Title not available (Why is that?)
- Self-regular functions and new search directions for linear and semidefinite optimization
- Title not available (Why is that?)
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A new primal-dual path-following method for convex quadratic programming
- An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- Steplengths in interior-point algorithms of quadratic programming
- A new primal-dual interior-point algorithm for convex quadratic optimization
- A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
Cited In (18)
- On extending primal-dual interior-point method for linear optimization to convex quadratic symmetric cone optimization
- Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- Continuous and discrete Zhang dynamics for real-time varying nonlinear optimization
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
- A new full-Newton step feasible interior point method for convex quadratic programming
- A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
- Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A full-Newton step interior-point algorithm for linear optimization based on a finite barrier
- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
- An efficient interior point method for linear optimization using modified Newton method
This page was built for publication: Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935397)
