Pages that link to "Item:Q1180826"
From MaRDI portal
The following pages link to A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826):
Displaying 50 items.
- A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function (Q255679) (← links)
- Sufficient weighted complementarity problems (Q288407) (← links)
- A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems (Q353550) (← links)
- Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem (Q376771) (← links)
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems (Q398651) (← links)
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
- A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function (Q451811) (← links)
- On the use of coordinate-free matrix calculus (Q476258) (← links)
- Enumeration of PLCP-orientations of the 4-cube (Q491752) (← links)
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP (Q497434) (← links)
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term (Q513522) (← links)
- Corrector-predictor methods for sufficient linear complementarity problems (Q538303) (← links)
- Interior point algorithm for \(P_*\) nonlinear complementarity problems (Q544204) (← links)
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem (Q606335) (← links)
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem (Q607084) (← links)
- Combinatorial characterizations of \(K\)-matrices (Q609481) (← links)
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems (Q611277) (← links)
- Solvability of Newton equations in smoothing-type algorithms for the SOCCP (Q629483) (← links)
- A non-interior continuation algorithm for the CP based on a generalized smoothing function (Q629488) (← links)
- A projected-gradient interior-point algorithm for complementarity problems (Q634730) (← links)
- Solving discrete systems of nonlinear equations (Q635151) (← links)
- On the complexity of computing the handicap of a sufficient matrix (Q644911) (← links)
- On the natural merit function for solving complementarity problems (Q647391) (← links)
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
- The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra (Q670662) (← links)
- Extension of GAMS for complementarity problems arising in applied economic analysis (Q672669) (← links)
- Determining the handicap of a sufficient matrix (Q677143) (← links)
- A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037) (← links)
- A path-following procedure to find a proper equilibrium of finite games (Q687992) (← links)
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- On the solution of NP-hard linear complementarity problems (Q699514) (← links)
- A new smoothing and regularization Newton method for \(P_{0}\)-NCP (Q708899) (← links)
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix (Q715065) (← links)
- Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path (Q722338) (← links)
- Column sufficient tensors and tensor complementarity problems (Q722434) (← links)
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem (Q732130) (← links)
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems (Q853548) (← links)
- On computer-assisted proofs for solutions of linear complementarity problems (Q861881) (← links)
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems (Q877592) (← links)
- Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality (Q883994) (← links)
- Parabolic target space and primal-dual interior-point methods (Q943845) (← links)
- Cyclic games and linear programming (Q944703) (← links)
- Generalizations of the hidden Minkowski property (Q947672) (← links)
- A field guide to the matrix classes found in the literature of the linear complementarity problem (Q967242) (← links)
- A polynomial path-following interior point algorithm for general linear complementarity problems (Q989885) (← links)
- Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions (Q997220) (← links)
- An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization (Q1000785) (← links)
