The following pages link to (Q5540119):
Displaying 49 items.
- Ragnar Frisch and interior-point methods (Q497438) (← links)
- An homage to Joseph-Louis Lagrange and Pierre Huard (Q537596) (← links)
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming (Q687091) (← links)
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
- Localization of multi-constrained optima and avoidance of local optima in structural optimization problems (Q801740) (← links)
- An approach for solving fuzzy implicit variational inequalities with linear membership functions (Q1005832) (← links)
- Interactive algorithms for multiple criteria nonlinear programming problems (Q1084013) (← links)
- A relaxed version of Karmarkar's method (Q1108926) (← links)
- A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927) (← links)
- New trajectory-following polynomial-time algorithm for linear programming problems (Q1114587) (← links)
- A method for the determination of the minimax (Q1118148) (← links)
- Karmarkar's linear programming algorithm and Newton's method (Q1176568) (← links)
- Pure adaptive search in global optimization (Q1184353) (← links)
- A polynomial method of approximate centers for linear programming (Q1196720) (← links)
- Rates of convergence for a method of centers algorithm (Q1215256) (← links)
- On the Pironneau-Polak method of centers (Q1221698) (← links)
- Method of centers for minimizing generalized eigenvalues (Q1260783) (← links)
- Quadratically constrained convex quadratic programmes: Faculty feasible regions (Q1278283) (← links)
- Methods of centers for variational inequalities and linear programming (Q1294369) (← links)
- An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs (Q1315412) (← links)
- On the rate of convergence of two minimax algorithms (Q1321092) (← links)
- Descent methods for convex essentially smooth minimization (Q1321119) (← links)
- On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
- On the classical logarithmic barrier function method for a class of smooth convex programming problems (Q1321158) (← links)
- Interior-point algorithm for quadratically constrained entropy minimization problems (Q1321322) (← links)
- A new linesearch method for quadratically constrained convex programming (Q1342277) (← links)
- Convergence analysis of norm-relaxed method of feasible directions (Q1359453) (← links)
- On the entropic regularization method for solving min-max problems with applications (Q1366322) (← links)
- Analytic centers and repelling inequalities (Q1848382) (← links)
- Potential reduction method for harmonically convex programming (Q1893464) (← links)
- A modification of the inscribed ellipsoid method (Q1900254) (← links)
- A method of Euclidean centers (Q1906945) (← links)
- Global optimization for the biaffine matrix inequality problem (Q1913606) (← links)
- An interior point method for general large-scale quadratic programming problems (Q1915920) (← links)
- New complexity results for the Iri-Imai method (Q1915925) (← links)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming (Q1919092) (← links)
- New variants of bundle methods (Q1922693) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- Solving fuzzy inequalities with concave membership functions (Q1964215) (← links)
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods (Q2576742) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method (Q3026741) (← links)
- A new variant of the primal affine scaling algorithm for linear programs (Q3979522) (← links)
- Optimization algorithms and point-to-set-maps (Q4070640) (← links)
- Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick) (Q4121710) (← links)
- An interior point method for nonlinear programming (Q4184632) (← links)
- A relaxed cutting plane algorithm for solving fuzzy inequality systems (Q4265518) (← links)
- Penalty function versus non-penalty function methods for constrained nonlinear programming problems (Q5653813) (← links)
- On the rate of convergence of certain methods of centers (Q5661332) (← links)
