scientific article; zbMATH DE number 3301975
From MaRDI portal
Publication:5583564
zbMath0189.19504MaRDI QIDQ5583564
Publication date: 1967
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Linear programming (90C05)
Related Items
An efficient logarithmic barrier method without line search for convex quadratic programming, Superlinear convergence of the affine scaling algorithm, Theoretical convergence of large-step primal-dual interior point algorithms for linear programming, Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem, An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming, Limiting behavior of the affine scaling continuous trajectories for linear programming problems, Interior Point Algorithms in Linear Optimization, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, An affine scaling method using a class of differential barrier functions: primal approach, On the chaotic behavior of the primal–dual affine–scaling algorithm for linear optimization, Characterizing the SLOPE trade-off: a variational perspective and the Donoho-Tanner limit, The Legendre Transformation in Modern Optimization, Fast sinkhorn. II: Collinear triangular matrix and linear time accurate computation of optimal transport, Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis, METHOD FOR SEQUENTIAL ACTIVATION OF LIMITATIONS IN LINEAR PROGRAMMING, Algorithms associated with arithmetic, geometric and harmonic means and integrable systems, A splitting method for quadratic programming problem, A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming, Unnamed Item, Entering into the domain of feasible solutions using interior point method, Interior point method: history and prospects, Generalized affine scaling algorithms for linear programming problems, Lagrangian transformation and interior ellipsoid methods in convex optimization, A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix, An interior point parameterized central path following algorithm for linearly constrained convex programming, An interior affine scaling cubic regularization algorithm for derivative-free optimization subject to bound constraints, A globally convergent primal-dual interior point algorithm for convex programming, Interior-point algorithms for semi-infinite programming, Convergence property of the Iri-Imai algorithm for some smooth convex programming problems, On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds, Stable barrier-projection and barrier-Newton methods in linear programming, Scaling, shifting and weighting in interior-point methods, Interior point method for long-term generation scheduling of large-scale hydrothermal systems, An interior-point method for multifractional programs with convex constraints, Fuzzy goal programming: complementary slackness conditions and computational schemes, Long-step strategies in interior-point primal-dual methods, Improved complexity using higher-order correctors for primal-dual Dikin affine scaling, Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems, Some variants of the Todd low-complexity algorithm, Feasible region contraction interior point algorithm, Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, A simple proof of a primal affine scaling method, An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption, The primal power affine scaling method, New complexity results for the Iri-Imai method, A potential reduction approach to the frequency assignment problem, An extension of Karmarkar's projective algorithm for convex quadratic programming, An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming, Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm, Cutting planes and column generation techniques with the projective algorithm, An interior point algorithm for semi-infinite linear programming, Trust region affine scaling algorithms for linearly constrained convex and concave programs, A primal-dual potential reduction method for problems involving matrix inequalities, An affine scaling reduced preconditional conjugate gradient path method for linear constrained optimization, Newton-KKT interior-point methods for indefinite quadratic programming, A trust region affine scaling method for bound constrained optimization, A polynomial arc-search interior-point algorithm for convex quadratic programming, A class of primal affine scaling algorithms, Hopfield neural networks in large-scale linear optimization problems, A new affine scaling interior point algorithm for nonlinear optimization subject to linear equality and inequality constraints., Cubically convergent method for locating a nearby vertex in linear programming, Dual interior point algorithms, An optimal-basis identification technique for interior-point linear programming algorithms, An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems, A primal projective interior point method for linear programming, A unified approach to interior point algorithms for linear complementarity problems: A summary, Global convergence of the affine scaling methods for degenerate linear programming problems, Comparative analysis of affine scaling algorithms based on simplifying assumptions, Improving the rate of convergence of interior point methods for linear programming, A survey of search directions in interior point methods for linear programming, Computational results of an interior point algorithm for large scale linear programming, Modified barrier functions (theory and methods), An inexact derivative-free Levenberg-Marquardt method for linear inequality constrained nonlinear systems under local error bound conditions, Ragnar Frisch and interior-point methods, A geometric view of parametric linear programming, On affine scaling algorithms for nonconvex quadratic programming, On the convergence of the affine-scaling algorithm, On affine scaling and semi-infinite programming, Long steps in an \(O(n^ 3L)\) algorithm for linear programming, A polynomial method of approximate centers for linear programming, Prior reduced fill-in in solving equations in interior point algorithms, Todd's low-complexity algorithm is a predictor-corrector path-following method, A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems, A variation on the interior point method for linear programming using the continued iteration, An active-set strategy in an interior point method for linear programming, Strict monotonicity in Todd's low-complexity algorithm for linear programming, The \(\ell_1\) solution of linear inequalities, A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions, A long-step barrier method for convex quadratic programming, Convergence behavior of interior-point algorithms, The mixing time of the Dikin walk in a polytope -- a simple proof, A first-order interior-point method for linearly constrained smooth optimization, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, An optimization framework of biological dynamical systems, Symmetric indefinite systems for interior point methods, Exploiting special structure in a primal-dual path-following algorithm, Efficient solution of two-stage stochastic linear programs using interior point methods, An affine scaling method for optimization problems with polyhedral constraints, An interior point method for quadratic programs based on conjugate projected gradients, Method of centers for minimizing generalized eigenvalues, An affine-scaling interior-point CBB method for box-constrained optimization, Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm, Computing material collapse displacement fields on a Cray X-MP/48 by the LP primal affine scaling algorithm, Feasible direction interior-point technique for nonlinear optimization, Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid, An implementation of Karmarkar's algorithm for linear programming, Affine scaling algorithm fails for semidefinite programming, Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach, Polynomial primal-dual cone affine scaling for semidefinite programming, The empirical performance of a polynomial algorithm for constrained nonlinear optimization, The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors, A unified view of interior point methods for linear programming, Feasibility issues in a primal-dual interior-point method for linear programming, Degeneracy in interior point methods for linear programming: A survey, A simplified global convergence proof of the affine scaling algorithm, Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems, Interior-point algorithms for global optimization, On monotonicity in the scaled potential algorithm for linear programming, The affine-scaling direction for linear programming is a limit of projective-scaling directions, The decomposition principle and algorithms for linear programming, An \(O(n^ 3L)\) potential reduction algorithm for linear programming, On solution-containing ellipsoids in linear programming, On the big \({\mathcal M}\) in the affine scaling algorithm, A primal-dual affine-scaling potential-reduction algorithm for linear programming, Lax pair and fixed point analysis of Karmarkar's projective scaling trajectory for linear programming, Gradient systems associated with probability distributions
