The following pages link to (Q5583564):
Displayed 50 items.
- A polynomial arc-search interior-point algorithm for convex quadratic programming (Q421610) (← links)
- A class of primal affine scaling algorithms (Q427024) (← links)
- Hopfield neural networks in large-scale linear optimization problems (Q428100) (← links)
- Ragnar Frisch and interior-point methods (Q497438) (← links)
- A variation on the interior point method for linear programming using the continued iteration (Q522093) (← links)
- A first-order interior-point method for linearly constrained smooth optimization (Q535018) (← links)
- Dual interior point algorithms (Q647858) (← links)
- An inexact derivative-free Levenberg-Marquardt method for linear inequality constrained nonlinear systems under local error bound conditions (Q671194) (← links)
- An active-set strategy in an interior point method for linear programming (Q687036) (← links)
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions (Q688916) (← links)
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- Convergence behavior of interior-point algorithms (Q689124) (← links)
- An affine scaling method for optimization problems with polyhedral constraints (Q742300) (← links)
- Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm (Q750203) (← links)
- Computing material collapse displacement fields on a Cray X-MP/48 by the LP primal affine scaling algorithm (Q752020) (← links)
- Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach (Q779763) (← 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)
- Interior-point algorithms for global optimization (Q804475) (← links)
- On monotonicity in the scaled potential algorithm for linear programming (Q805164) (← links)
- The affine-scaling direction for linear programming is a limit of projective-scaling directions (Q806963) (← links)
- The decomposition principle and algorithms for linear programming (Q806964) (← links)
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming (Q811360) (← links)
- Interior point method for long-term generation scheduling of large-scale hydrothermal systems (Q839779) (← links)
- Fuzzy goal programming: complementary slackness conditions and computational schemes (Q849750) (← links)
- Feasible region contraction interior point algorithm (Q858800) (← links)
- An affine scaling reduced preconditional conjugate gradient path method for linear constrained optimization (Q879466) (← links)
- Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
- Cubically convergent method for locating a nearby vertex in linear programming (Q911456) (← links)
- The \(\ell_1\) solution of linear inequalities (Q959132) (← links)
- An affine-scaling interior-point CBB method for box-constrained optimization (Q1013965) (← links)
- An extension of Karmarkar's projective algorithm for convex quadratic programming (Q1121792) (← links)
- Cutting planes and column generation techniques with the projective algorithm (Q1123123) (← links)
- An interior point algorithm for semi-infinite linear programming (Q1123804) (← 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 primal projective interior point method for linear programming (Q1176804) (← links)
- A unified approach to interior point algorithms for linear complementarity problems: A summary (Q1180826) (← links)
- Global convergence of the affine scaling methods for degenerate linear programming problems (Q1181905) (← links)
- Comparative analysis of affine scaling algorithms based on simplifying assumptions (Q1181906) (← links)
- Improving the rate of convergence of interior point methods for linear programming (Q1181911) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- Computational results of an interior point algorithm for large scale linear programming (Q1181915) (← links)
- Modified barrier functions (theory and methods) (Q1186277) (← links)
- A geometric view of parametric linear programming (Q1193520) (← links)
- On affine scaling algorithms for nonconvex quadratic programming (Q1196182) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- On affine scaling and semi-infinite programming (Q1196188) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)