A new primal-dual path-following method for convex quadratic programming
From MaRDI portal
Publication:539783
zbMath1213.90187MaRDI QIDQ539783
Publication date: 30 May 2011
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.scielo.br/scielo.php?script=sci_abstract&pid=S1807-03022006000100005&lng=en&nrm=iso&tlng=en
convex quadratic programminginterior point methodsconvergence of algorithmsprimal-dual path-following methods
Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Interior-point methods (90C51)
Related Items (47)
Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function ⋮ Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation ⋮ Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems ⋮ An infeasible interior-point method with improved centering steps for monotone linear complementarity problems ⋮ Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function ⋮ An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function ⋮ An interior-point algorithm for semidefinite least-squares problems. ⋮ A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization ⋮ Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier ⋮ A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization ⋮ New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization ⋮ Interior-point algorithm for linear programming based on a new descent direction ⋮ Log-domain interior-point methods for convex quadratic programming ⋮ Solving nonmonotone affine variational inequalities problem by DC programming and DCA ⋮ A class of new search directions for full-NT step feasible interior point method in semidefinite optimization ⋮ A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods ⋮ A new search direction for full-Newton step infeasible interior-point method in linear optimization ⋮ A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP ⋮ Unnamed Item ⋮ Unnamed Item ⋮ New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function ⋮ A generalized direction in interior point method for monotone linear complementarity problems ⋮ A new full-NT step interior-point method for circular cone optimization ⋮ An infeasible interior-point algorithm with full-Newton step for linear optimization ⋮ A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP ⋮ A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization ⋮ Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems ⋮ Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term ⋮ A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization ⋮ An infeasible interior point method for the monotone SDLCP based on a transformation of the central path ⋮ New method for determining search directions for interior-point algorithms in linear optimization ⋮ A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step ⋮ Unnamed Item ⋮ An extension for identifying search directions for interior-point methods in linear optimization ⋮ A new primal-dual path-following interior-point algorithm for semidefinite optimization ⋮ Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO ⋮ A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function ⋮ A polynomial-time weighted path-following interior-point algorithm for linear optimization ⋮ A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An exterior point polynomial-time algorithm for convex quadratic programming ⋮ A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
This page was built for publication: A new primal-dual path-following method for convex quadratic programming
