Pages that link to "Item:Q4377574"
From MaRDI portal
The following pages link to An Infeasible-Interior-Point Method for Linear Complementarity Problems (Q4377574):
Displaying 10 items.
- A limited memory quasi-Newton trust-region method for box constrained optimization (Q269370) (← links)
- On the natural merit function for solving complementarity problems (Q647391) (← links)
- Global convergence enhancement of classical linesearch interior point methods for MCPs (Q1861321) (← links)
- Iterative descent method for generalized Leontief model (Q2057501) (← links)
- A potential reduction method for tensor complementarity problems (Q2313741) (← links)
- An efficient implementation of a trust region method for box constrained optimization (Q2346512) (← links)
- The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
- Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones (Q3112509) (← links)
- An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games (Q5087713) (← links)
- A two-step matrix splitting method for the mixed linear complementarity problem (Q6616900) (← links)