Path-Following Methods for Linear Programming
From MaRDI portal
Publication:4016916
DOI10.1137/1034048zbMath0763.90063OpenAlexW2036622774WikidataQ93581040 ScholiaQ93581040MaRDI QIDQ4016916
Publication date: 16 January 1993
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1034048
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Numerically efficient and robust Interior-point algorithm for finite strain rate-independent crystal plasticity, A step-truncated method in a wide neighborhood interior-point algorithm for linear programming, IFORS' Operational Research Hall of Fame: Clóvis Caesar Gonzaga, The aggregate constraint homotopy method for nonconvex nonlinear programming, General central path and the largest step general central path following algorithm for linear programming, A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix, Analysis of some interior point continuous trajectories for convex programming, Controlled dual perturbations for central path trajectories in geometric programming, AN ENTROPY CONTINUATION METHOD FOR A CLASS OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS, Primal-dual algorithms for linear programming based on the logarithmic barrier method, The convergence of an interior-point method using modified search directions in final iterations, Asymptotic analysis of the exponential penalty trajectory in linear programming, Some properties of the Hessian of the logarithmic barrier function, Scaling, shifting and weighting in interior-point methods, Strict quasi-concavity and the differential barrier property of gauges in linear programming, On controlling the parameter in the logarithmic barrier term for convex programming problems, Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints, A primal-dual interior point method whose running time depends only on the constraint matrix, Crash start of interior point methods, Potential-reduction methods in mathematical programming, Fast convergence of the simplified largest step path following algorithm, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, Volumetric path following algorithms for linear programming, Fast Cholesky factorization for interior point methods of linear programming, The challenges of estimating the impact of distributed energy resources flexibility on the TSO/DSO boundary node operating points, The largest step path following algorithm for monotone linear complementarity problems, Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, The interior-point revolution in optimization: History, recent developments, and lasting consequences, Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case, Primal-dual target-following algorithms for linear programming, A lower bound on the number of iterations of long-step primal-dual linear programming algorithms, The Newton modified barrier method for QP problems, New complexity results for the Iri-Imai method, An infeasible-start path-following method for monotone LCPs, New infeasible interior-point algorithm based on monomial method, Coupling the proximal point algorithm with approximation methods, A cutting plane method from analytic centers for stochastic programming, A primal-dual potential reduction method for problems involving matrix inequalities, Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data, An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities, Primal-dual methods for linear programming, Linear programming, complexity theory and elementary functional analysis, A numerical study of an infeasible primal-dual path-following algorithm for linear programming, Complexity analysis of interior point methods for linear programming based on a parameterized kernel function, A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function, Rescaled proximal methods for linearly constrained convex problems, Dual convergence for penalty algorithms in convex programming, Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term, An interior-exterior approach for convex quadratic programming, A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems, Stochastic robustness metric and its use for static resource allocations, Interior point methods 25 years later, An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming, A noninterior path following algorithm for solving a class of multiobjective programming problems, Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization, On the Use of Duality and Pricing Criteria in the Generalized‐simplex Method, Generic Primal-dual Interior Point Methods Based on a New Kernel Function, A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms, A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION, On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems, A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions, An interior point algorithm for convex quadratic programming with strict equilibrium constraints, Equivalent formulae for the supremum and stability of weighted pseudoinverses, Dual versus primal-dual interior-point methods for linear and conic programming, Affine scaling with degenerate linear programming problems, A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming, Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods, A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm, Generation of degenerate linear programming problems, Two simple proofs for analyticity of the central path in linear programming., Improved complexity results on solving real-number linear feasibility problems, A primal‐dual interior-point method for linear optimization based on a new proximity function, Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, Examples of ill-behaved central paths in convex optimization, Asymptotic expansions for interior penalty solutions of control constrained linear-quadratic problems, An interior-point algorithm for linear optimization based on a new barrier function, A Frisch-Newton algorithm for sparse quantile regression, A polynomial-time algorithm for linear optimization based on a new class of kernel functions, Interior hybrid proximal extragradient methods for the linear monotone complementarity problem, Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming, New theoretical results on recursive quadratic programming algorithms, A new neural network for solving linear programming problems, Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem, An interior point potential reduction method for constrained equations, Multiple centrality corrections in a primal-dual method for linear programming, On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method, Une procédure de purification pour les problèmes de complémentarité linéaire, monotones, Using an interior point method for the master problem in a decomposition approach, A circular cone relaxation primal interior point algorithm for LP, Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics, Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming, Condition measures and properties of the central trajectory of a linear program, Warm start of the primal-dual method applied in the cutting-plane scheme, Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method, The role of the augmented system in interior point methods, Analytic centers and repelling inequalities, Symbiosis between linear algebra and optimization, An analytic center cutting plane algorithm for finding equilibrium points, Interior-point methods with decomposition for solving large-scale linear programs, 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, Perturbed path following predictor-corrector interior point algorithms, Degeneracy in interior point methods for linear programming: A survey, An interactive interior point algorithm for multiobjective linear programming problems, Modified predictor-corrector algorithm for locating weighted centers in linear programming, An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method
