scientific article; zbMATH DE number 3301975

Cited in

(only showing first 100 items - show all)

Algorithms associated with arithmetic, geometric and harmonic means and integrable systems
An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
Interior-point algorithms for semi-infinite programming
An affine scaling method using a class of differential barrier functions: primal approach
Lagrangian transformation and interior ellipsoid methods in convex optimization
An interior point algorithm for semi-infinite linear programming
The _1 solution of linear inequalities
On the chaotic behavior of the primal-dual affine-scaling algorithm for linear optimization
An efficient logarithmic barrier method without line search for convex quadratic programming
Interior point method: history and prospects
Affine scaling algorithm fails for semidefinite programming
Interior point method for long-term generation scheduling of large-scale hydrothermal systems
Interior point algorithms in linear optimization
An interior point method for quadratic programs based on conjugate projected gradients
Scaling, shifting and weighting in interior-point methods
Cutting planes and column generation techniques with the projective algorithm
An active-set strategy in an interior point method for linear programming
A polynomial method of approximate centers for linear programming
Long steps in an \(O(n^ 3L)\) algorithm for linear programming
A long-step barrier method for convex quadratic programming
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
Feasibility issues in a primal-dual interior-point method for linear programming
Global convergence of the affine scaling methods for degenerate linear programming problems
Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
A unified approach to interior point algorithms for linear complementarity problems: A summary
A primal-dual potential reduction method for problems involving matrix inequalities
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
A class of primal affine scaling algorithms
Hopfield neural networks in large-scale linear optimization problems
Convergence behavior of interior-point algorithms
Method of centers for minimizing generalized eigenvalues
Feasible region contraction interior point algorithm
Trust region affine scaling algorithms for linearly constrained convex and concave programs
Generalized affine scaling algorithms for linear programming problems
Computational results of an interior point algorithm for large scale linear programming
Modified barrier functions (theory and methods)
A first-order interior-point method for linearly constrained smooth optimization
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
Degeneracy in interior point methods for linear programming: A survey
The mixing time of the Dikin walk in a polytope -- a simple proof
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
A polynomial arc-search interior-point algorithm for convex quadratic programming
Symmetric indefinite systems for interior point methods
Characterizing the SLOPE trade-off: a variational perspective and the Donoho-Tanner limit
Feasible direction interior-point technique for nonlinear optimization
Accelerating the B\&B algorithm for integer programming based on flatness information: an approach applied to the multidimensional knapsack problem
An implementation of Karmarkar's algorithm for linear programming
The primal power affine scaling method
An affine-scaling interior-point CBB method for box-constrained optimization
An interior point parameterized central path following algorithm for linearly constrained convex programming
An interior-point method for multifractional programs with convex constraints
Some variants of the Todd low-complexity algorithm
A splitting method for quadratic programming problem
Superlinear convergence of the affine scaling algorithm
Newton-KKT interior-point methods for indefinite quadratic programming
Spectrally constrained optimization
A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
An interior affine scaling cubic regularization algorithm for derivative-free optimization subject to bound constraints
Gradient systems associated with probability distributions
A globally convergent primal-dual interior point algorithm for convex programming
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
The empirical performance of a polynomial algorithm for constrained nonlinear optimization
Fast sinkhorn. II: Collinear triangular matrix and linear time accurate computation of optimal transport
An \(O(n^ 3L)\) potential reduction algorithm for linear programming
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
New complexity results for the Iri-Imai method
An optimization framework of biological dynamical systems
The Legendre transformation in modern optimization
Long-step strategies in interior-point primal-dual methods
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
A simple proof of a primal affine scaling method
A potential reduction approach to the frequency assignment problem
A trust region affine scaling method for bound constrained optimization
Stable barrier-projection and barrier-Newton methods in linear programming
On solution-containing ellipsoids in linear programming
Lax pair and fixed point analysis of Karmarkar's projective scaling trajectory for linear programming
An optimal-basis identification technique for interior-point linear programming algorithms
A primal projective interior point method for linear programming
The decomposition principle and algorithms for linear programming
A geometric view of parametric linear programming
Exploiting special structure in a primal-dual path-following algorithm
Convergence property of the Iri-Imai algorithm for some smooth convex programming problems
Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach
Comparative analysis of affine scaling algorithms based on simplifying assumptions
Improving the rate of convergence of interior point methods for linear programming
Cubically convergent method for locating a nearby vertex in linear programming
A primal-dual affine-scaling potential-reduction algorithm for linear programming
On the big \({\mathcal M}\) in the affine scaling algorithm
Sequential quadratic optimization for stochastic optimization with deterministic nonlinear inequality and equality constraints
An affine scaling method for optimization problems with polyhedral constraints
Dual interior point algorithms
Entering into the domain of feasible solutions using interior point method
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
An extension of Karmarkar's projective algorithm for convex quadratic programming

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5583564)