Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
From MaRDI portal
Publication:3608974
DOI10.1137/060670341zbMATH Open1171.90017OpenAlexW2047669906MaRDI QIDQ3608974FDOQ3608974
Publication date: 6 March 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060670341
Recommendations
- Superlinear primal-dual affine scaling algorithms for LCP
- A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP
- scientific article; zbMATH DE number 2059754
- On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP
- Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05) Interior-point methods (90C51) Newton-type methods (49M15)
Cited In (15)
- An affine scaling method using a class of differential barrier functions: primal approach
- Superlinear primal-dual affine scaling algorithms for LCP
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
- A Corrector-Predictor Interior-Point Algorithm for P∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones
- INTERIOR POINT METHOD FOR SOLVING LINEAR PROGRAMMING WITH INTERVAL COEFFICIENTS USING AFFINE SCALING
- An interior affine scaling projective algorithm for nonlinear equality and linear inequality constrained optimization
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
- Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case
- Trajectory-following methods for large-scale degenerate convex quadratic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the natural merit function for solving complementarity problems
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- A survey on the high convergence orders and computational convergence orders of sequences
This page was built for publication: Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608974)
