Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function
From MaRDI portal
Publication:3177630
Recommendations
- Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
- Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term
- Complexity analysis of primal-dual interior-point methods for linear optimization based on a new efficient bi-parameterized kernel function with a trigonometric barrier term
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
Cites work
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
- A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
- A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A new primal-dual path-following method for convex quadratic programming
- A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
- Complexity analysis of primaldual algorithms for the semidefinite linear complementarity problem
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- New complexity analysis of the primal-dual Newton method for linear optimization
- New interior point algorithms in linear programming
- On semidefinite linear complementarity problems
- Polynomial convergence of primal-dual algorithms for SDLCP based on the M-Z family of directions
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
- Self-regular functions and new search directions for linear and semidefinite optimization
- The \(Q\)-property of a multiplicative transformation in semidefinite linear complementarity problems
- The semidefinite linear complementarity problem
Cited in
(2)
This page was built for publication: Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177630)
