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):
Displayed 50 items.
- 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 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)
- 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)
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function (Q1002309) (← links)
- A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826) (← links)
- Two characterizations of sufficient matrices (Q1190115) (← links)
- Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP (Q1264999) (← links)
- On the long-step path-following method for semidefinite programming (Q1273093) (← links)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- Symmetric primal-dual path-following algorithms for semidefinite programming (Q1294556) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems (Q1321256) (← links)
- A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems (Q1321811) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- Constant potential primal-dual algorithms: A framework (Q1340053) (← links)
- Extended \(P\)-pairs (Q1355215) (← links)
- Long-step strategies in interior-point primal-dual methods (Q1361105) (← links)
- Fast convergence of the simplified largest step path following algorithm (Q1361106) (← links)
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points (Q1361112) (← links)
- The largest step path following algorithm for monotone linear complementarity problems (Q1363413) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- Deriving potential functions via a symmetry principle for nonlinear equations (Q1375121) (← links)
- Predictor-corrector method for nonlinear complementarity problems (Q1387608) (← links)
- EP theorems and linear complementarity problems (Q1392569) (← links)
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function (Q1411490) (← links)
- \(d\)-orientation sequences for continuous functions and nonlinear complementarity problems (Q1569112) (← links)
- An alternative theorem for generalized variational inequalities and solvability of nonlinear quasi-\(P^M_*\)-complementarity problems (Q1569178) (← links)
- Similarity and other spectral relations for symmetric cones (Q1573667) (← links)
- Quasi-P\(_*\)-maps, P(\(\tau,\alpha,\beta\))-maps, exceptional family of elements, and complementarity problems (Q1579642) (← links)
- On weighted centers for semidefinite programming (Q1584796) (← links)
- Piecewise linear methods for nonlinear equations and optimization (Q1593829) (← links)
- The Kantorovich theorem and interior point methods (Q1769068) (← links)
- Examples of ill-behaved central paths in convex optimization (Q1777216) (← links)
- A continuation algorithm for a class of linear complementarity problems using an extrapolation technique (Q1801456) (← links)