scientific article; zbMATH DE number 7021657

zbMath1406.90074MaRDI QIDQ4622764

Nesrine Tabchouche, Achache Mohamed

Publication date: 14 February 2019

Full work available at URL: https://hrcak.srce.hr/ojs/index.php/crorr/article/view/5713

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial complexityinterior-point algorithmshort-step methodsemidefinite linear complementarity

Mathematics Subject Classification ID

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

Cites Work

• A new primal-dual path-following method for convex quadratic programming
• Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• On some interconnections between strict monotonicity, globally uniquely solvable, and \(P\) properties in semidefinite linear complementarity problems.
• On semidefinite linear complementarity problems
• A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp^∗
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item