On homogeneous and self-dual algorithms for LCP
From MaRDI portal
Publication:1361111
DOI10.1007/BF02614384zbMATH Open0881.90116OpenAlexW2065615220MaRDI QIDQ1361111FDOQ1361111
Publication date: 19 February 1998
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02614384
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
monotone linear complementarityhomogeneous and self-dual linear programminginfeasible-starting algorithm
Cites Work
- Title not available (Why is that?)
- Some perturbation theory for linear programming
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
- Error bounds for monotone linear complementarity problems
- Convergence behavior of interior-point algorithms
- Local convergence of interior-point algorithms for degenerate monotone LCP
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
Cited In (21)
- Interior-point algorithm based on general kernel function for monotone linear complementarity problem
- A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties
- A homogeneous model for monotone mixed horizontal linear complementarity problems
- An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem
- An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
- Sparse solutions of linear complementarity problems
- On a homogeneous algorithm for the monotone complementarity problem
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- A homogeneous smoothing-type algorithm for symmetric cone linear programs
- Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- Verification for existence of solutions of linear complementarity problems
- A generalized homogeneous and self-dual algorithm for linear programming
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- A logarithmic descent direction algorithm for the quadratic knapsack problem
- Improved bounds on the energy-minimizing strains in martensitic polycrystals
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
- A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems
- Conic convex programming and self-dual embedding
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)
