scientific article; zbMATH DE number 3253619
From MaRDI portal
Publication:5540119
zbMath0157.49701MaRDI QIDQ5540119
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Interactive algorithms for multiple criteria nonlinear programming problems, A relaxed cutting plane algorithm for solving fuzzy inequality systems, A new linesearch method for quadratically constrained convex programming, A new variant of the primal affine scaling algorithm for linear programs, Potential reduction method for harmonically convex programming, An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming, A modification of the inscribed ellipsoid method, Convergence analysis of norm-relaxed method of feasible directions, A relaxed version of Karmarkar's method, A polynomial-time algorithm, based on Newton's method, for linear programming, A method of Euclidean centers, On the entropic regularization method for solving min-max problems with applications, New trajectory-following polynomial-time algorithm for linear programming problems, Global optimization for the biaffine matrix inequality problem, A method for the determination of the minimax, An interior point method for general large-scale quadratic programming problems, New complexity results for the Iri-Imai method, An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming, New variants of bundle methods, An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities, Penalty function versus non-penalty function methods for constrained nonlinear programming problems, On the rate of convergence of certain methods of centers, Optimization algorithms and point-to-set-maps, Solving fuzzy inequalities with concave membership functions, Karmarkar's linear programming algorithm and Newton's method, Pure adaptive search in global optimization, Ragnar Frisch and interior-point methods, A polynomial method of approximate centers for linear programming, An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming, On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm, On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method, Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick), An homage to Joseph-Louis Lagrange and Pierre Huard, Rates of convergence for a method of centers algorithm, On the Pironneau-Polak method of centers, An approach for solving fuzzy implicit variational inequalities with linear membership functions, Method of centers for minimizing generalized eigenvalues, An interior point method for nonlinear programming, Quadratically constrained convex quadratic programmes: Faculty feasible regions, Methods of centers for variational inequalities and linear programming, Analytic centers and repelling inequalities, Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods, Localization of multi-constrained optima and avoidance of local optima in structural optimization problems, An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs, On the rate of convergence of two minimax algorithms, Descent methods for convex essentially smooth minimization, On the convergence of the coordinate descent method for convex differentiable minimization, On the classical logarithmic barrier function method for a class of smooth convex programming problems, Interior-point algorithm for quadratically constrained entropy minimization problems
