On homogeneous and self-dual algorithms for LCP
From MaRDI portal
(Redirected from Publication:1361111)
Recommendations
- On a homogeneous algorithm for the monotone complementarity problem
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- A generalized homogeneous and self-dual algorithm for linear programming
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Convergence behavior of interior-point algorithms
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Error bounds for monotone linear complementarity problems
- Local convergence of interior-point algorithms for degenerate monotone LCP
- Some perturbation theory for linear programming
Cited in
(21)- A logarithmic descent direction algorithm for the quadratic knapsack problem
- A homogeneous model for monotone mixed horizontal linear complementarity problems
- An infeasible full-NT step IPM for \(P_\ast(\kappa)\) horizontal linear complementarity problem over Cartesian product of symmetric cones
- Verification for existence of solutions of linear complementarity problems
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- A generalized homogeneous and self-dual algorithm for linear programming
- An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
- A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
- An interior-point algorithm based on general kernel function for monotone linear complementarity problem
- A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems
- Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- On a homogeneous algorithm for the monotone complementarity problem
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- Conic convex programming and self-dual embedding
- Sparse solutions of linear complementarity problems
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Operator splitting for a homogeneous embedding of the linear complementarity problem
- Improved bounds on the energy-minimizing strains in martensitic polycrystals
- A homogeneous smoothing-type algorithm for symmetric cone linear programs
This page was built for publication: On homogeneous and self-dual algorithms for LCP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361111)
