Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
From MaRDI portal
Publication:4235448
Recommendations
- An infeasible-start path-following method for monotone LCPs
- An Infeasible Path-Following Method for Monotone Complementarity Problems
- A path-following interior-point algorithm for monotone LCP based on a modified Newton search direction
- A High-Order Path-Following Method for Locating the Least 2-Norm Solution of Monotone LCPs
- On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems
- A new path-following interior-point algorithm for monotone semidefinite linear complementarity problems
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems
- scientific article; zbMATH DE number 1054759
- A path following method for LCP with superlinearly convergent iteration sequence
- Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
Cites work
- A primal-dual infeasible-interior-point algorithm for linear programming
- An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
- An Interior-Point Method for Semidefinite Programming
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
- scientific article; zbMATH DE number 741122 (Why is no real title available?)
- scientific article; zbMATH DE number 1182576 (Why is no real title available?)
- scientific article; zbMATH DE number 1372695 (Why is no real title available?)
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Matrix Analysis
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
Cited in
(15)- A path following interior-point method for linear complementarity problems over circular cones
- A potential reduction algorithm for an extended SDP problem
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence
- Solvability of semidefinite complementarity problems
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem
- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants
- A full Nesterov-Todd step primal-dual path-following interior point algorithm for semidefinite linear complementarity problems
- Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
This page was built for publication: Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4235448)
