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.1462356zbMath1402.90188OpenAlexW2799587148WikidataQ129936972 ScholiaQ129936972MaRDI QIDQ3177630

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

kernel functioninterior-point methodsiteration boundsemidefinite linear complementarity problemslarge-step method

Mathematics Subject Classification ID

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

Related Items (1)

A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
• 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
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• On semidefinite linear complementarity problems
• 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
• Self-regular functions and new search directions for linear and semidefinite optimization
• Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
• Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
• Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp^∗
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• New complexity analysis of the primal-dual Newton method for linear optimization

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