Complexity analysis of primaldual algorithms for the semidefinite linear complementarity problem

MaRDI QIDQ2839535zbMATH OpenFDO

Authors Mohamed Achache, Naima Boudiaf

Publication date 11 July 2013

Published in Revue d'Analyse Numérique et de Théorie de l'Approximation (Search for Journal in Brave)

zbMATH Keywords

interior point methodspolynomial complexitysemidefinite linear complementarity problemslong and small-update primal-dual algorithms

Mathematics Subject Classification ID

Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A full Nesterov-Todd step primal-dual path-following interior point algorithm for semidefinite linear complementarity problems
• A new path-following interior-point algorithm for monotone semidefinite linear complementarity problems
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
• New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction
• Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions

Cited in

(13)

• Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
• Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
• An interior-point algorithm for semidefinite least-squares problems.
• Path-following interior-point algorithm for monotone linear complementarity problems
• A full Nesterov-Todd step primal-dual path-following interior point algorithm for semidefinite linear complementarity problems
• New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction
• An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
• A new path-following interior-point algorithm for monotone semidefinite linear complementarity problems
• Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood
• A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
• A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
• Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants
• Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function

This page was built for publication: Complexity analysis of primaldual algorithms for the semidefinite linear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2839535)