The following pages link to (Q3491304):
Displaying 50 items.
- Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm (Q257838) (← links)
- An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem (Q279835) (← links)
- A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood (Q306400) (← links)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- An adaptive-step primal-dual interior point algorithm for linear optimization (Q425813) (← links)
- Regularization techniques in interior point methods (Q432801) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- Interior point algorithm for \(P_*\) nonlinear complementarity problems (Q544204) (← links)
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- The \(Q\) method for symmetric cone programming (Q639204) (← links)
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming (Q644523) (← links)
- The double pivot simplex method (Q684156) (← links)
- An active-set strategy in an interior point method for linear programming (Q687036) (← links)
- A little theorem of the big \({\mathcal M}\) in interior point algorithms (Q687037) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function (Q742844) (← links)
- An adaptive infeasible interior-point algorithm for linear complementarity problems (Q743784) (← links)
- A unified view of interior point methods for linear programming (Q803041) (← links)
- Feasibility issues in a primal-dual interior-point method for linear programming (Q803044) (← links)
- Computational experience with a primal-dual interior point method for linear programming (Q808184) (← links)
- Measurement of returns to scale using a non-radial DEA model: a range-adjusted measure approach (Q853082) (← links)
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions (Q858773) (← links)
- On the complexity of a combined homotopy interior method for convex programming (Q859861) (← links)
- An adaptation of the dual-affine interior point method for the surface flatness problem (Q877663) (← links)
- Cubically convergent method for locating a nearby vertex in linear programming (Q911456) (← links)
- Homotopy method for a general multiobjective programming problem (Q937132) (← links)
- An interior-point algorithm for nonlinear minimax problems (Q963659) (← links)
- Note on implementing the new sphere method for LP using matrix inversions sparingly (Q1001333) (← links)
- A globally convergent interior point algorithm for non-convex nonlinear programming (Q1002202) (← links)
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function (Q1002309) (← links)
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← links)
- New trajectory-following polynomial-time algorithm for linear programming problems (Q1114587) (← links)
- A new continuation method for complementarity problems with uniform P- functions (Q1121180) (← links)
- Interior path following primal-dual algorithms. I: Linear programming (Q1123121) (← links)
- A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method (Q1127255) (← links)
- An optimal-basis identification technique for interior-point linear programming algorithms (Q1174842) (← links)
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569) (← links)
- A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (Q1181916) (← links)
- Unified complexity analysis for Newton LP methods (Q1184332) (← links)
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updating (Q1186945) (← links)
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise (Q1206441) (← links)
- A new polynomial time method for a linear complementarity problem (Q1207309) (← links)
- Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm (Q1266672) (← links)
- On the long-step path-following method for semidefinite programming (Q1273093) (← links)
