The following pages link to (Q4206561):
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)
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (Q306399) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- A full-Newton step interior-point algorithm based on modified Newton direction (Q408387) (← links)
- An adaptive-step primal-dual interior point algorithm for linear optimization (Q425813) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- Ragnar Frisch and interior-point methods (Q497438) (← links)
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
- The \(Q\) method for symmetric cone programming (Q639204) (← links)
- The double pivot simplex method (Q684156) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← 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 efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) (← links)
- The relation between the path of centers and Smale's regularization of the linear programming problem (Q803732) (← links)
- Computational experience with a primal-dual interior point method for linear programming (Q808184) (← links)
- A quadratically convergent method for linear programming (Q808185) (← links)
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
- On a special class of regularized central paths for semidefinite programs (Q847845) (← 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)
- Polynomial time second order mehrotra-type predictor--corrector algorithms (Q864824) (← links)
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms (Q881509) (← links)
- Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality (Q883994) (← links)
- Note on implementing the new sphere method for LP using matrix inversions sparingly (Q1001333) (← links)
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
- A globally convergent interior point algorithm for non-convex nonlinear programming (Q1002202) (← links)
- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region (Q1003486) (← links)
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method (Q1127255) (← links)
- Solving a class of LP problems with a primal-dual logarithmic barrier method (Q1129972) (← 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)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise (Q1206441) (← links)
- A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
- On the big \({\mathcal M}\) in the affine scaling algorithm (Q1321664) (← links)
- A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Global convergence in infeasible-interior-point algorithms (Q1334952) (← links)
- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems (Q1335125) (← links)
- Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming (Q1338138) (← links)
- Limiting behavior of weighted central paths in linear programming (Q1338144) (← links)
- Polynomiality of infeasible-interior-point algorithms for linear programming (Q1340070) (← links)
- Asymptotic analysis of the exponential penalty trajectory in linear programming (Q1341567) (← links)
- Recovering an optimal LP basis from an interior point solution (Q1342078) (← links)
- Scaling, shifting and weighting in interior-point methods (Q1342881) (← links)
- A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307) (← links)
- A combined homotopy interior point method for general nonlinear programming problems (Q1354287) (← links)
