Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function

DOI10.1080/02331934.2018.1462356zbMATH Open1402.90188OpenAlexW2799587148WikidataQ129936972 ScholiaQ129936972MaRDI QIDQ3177630FDOQ3177630

Mohamed Achache, Nesrine Tabchouche

Publication date: 1 August 2018

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2018.1462356

zbMATH Keywords

interior-point methodskernel functioniteration boundsemidefinite linear complementarity problemslarge-step method

Mathematics Subject Classification ID

Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Self-regular functions and new search directions for linear and semidefinite optimization
• A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
• Title not available (Why is that?)
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Title not available (Why is that?)
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• On semidefinite linear complementarity problems
• A new primal-dual path-following method for convex quadratic programming
• A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
• New complexity analysis of the primal-dual Newton method for linear optimization
• Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp^∗
• Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
• A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
• Title not available (Why is that?)
• The \(Q\)-property of a multiplicative transformation in semidefinite linear complementarity problems
• Complexity analysis of primaldual algorithms for the semidefinite linear complementarity problem
• A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
• A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm
• Polynomial convergence of primal-dual algorithms for SDLCP based on the M-Z family of directions

Cited In (2)

• A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier

   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 👍 👎

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)