A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
From MaRDI portal
Publication:1014009
DOI10.1007/s10957-008-9389-zzbMath1165.90564OpenAlexW2145583730MaRDI QIDQ1014009
M. El Ghami, Goran Lešaja, Guo-Qiang Wang, Yan-Qin Bai, Cornelis Roos
Publication date: 24 April 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://resolver.tudelft.nl/uuid:e238c69d-1109-47c3-9a5e-e93b141f7999
Related Items
A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds, A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems, Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function, A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem, A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function, The accuracy of interior-point methods based on kernel functions, Complexity analysis of interior point methods for linear programming based on a parameterized kernel function, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, A step-truncated method in a wide neighborhood interior-point algorithm for linear programming, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation, A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods, A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones, Unnamed Item, Primal-dual interior-point algorithm for convex quadratic semi-definite optimization, Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term, A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION, New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP, Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term, Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems, An efficient parameterized logarithmic kernel function for semidefinite optimization, An interior-point algorithm for linear optimization based on a new barrier function, An efficient parameterized logarithmic kernel function for linear optimization, Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood, Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions, Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem, A new primal-dual path-following interior-point algorithm for semidefinite optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Self-regular functions and new search directions for linear and semidefinite optimization
- A primal‐dual interior-point method for linear optimization based on a new proximity function
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A polynomial-time algorithm for linear optimization based on a new simple kernel function
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
