On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method

From MaRDI portal
Publication:3026741

DOI10.1007/BF02592025zbMath0624.90062WikidataQ29012907 ScholiaQ29012907MaRDI QIDQ3026741

Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright, John A. Tomlin

Publication date: 1986

Published in: Mathematical Programming (Search for Journal in Brave)


zbMATH Keywords

barrier function methodKaramarkar's projective methodprojected Newton search


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)


Related Items

Linear programming with entropic perturbation, Proximal interior point approach in convex programming (ill-posed problems)*†, Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem, Linear programming by minimizing distances, Search directions for interior linear-programming methods, Perturbed variations of penalty function methods. Example: Projective SUMT, Applications of one-shot methods in PDEs constrained shape optimization, The interior-point revolution in optimization: History, recent developments, and lasting consequences, An unconstrained convex programming view of linear programming, Insights into the interior-point methods, A quadratically convergent scaling newton’s method for nonlinear complementarity problems, An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions, A variable-metric variant of the Karmarkar algorithm for linear programming, A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier, A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems, The method of quasi-solutions based on barrier functions in the analysis of improper convex programs, Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming, Method of approximate centers for semi-definite programming, Silving Linear Programs With Inequality Constraints Via Perturbation of Feasible Region, A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds, Implementing cholesky factorization for interior point methods of linear programming, On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method, A variation on Karmarkar’s algorithm for solving linear programming problems, Splitting dense columns of constraint matrix in interior point methods for large scale linear programming11The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex 16, France$ef:22A preliminary version of the paper has been presented at the Applied Mathematical Programming and Modelling Symposium APMOD’91 in London, January 14-…, On using exterior penalty approaches for solving linear programming problems, The aggregate constraint homotopy method for nonconvex nonlinear programming, Symbolic implementation of interior point method for linear programming problem, A continuation method for solving convex programming problemsviafischer reformulation, El metodo de Karmarkar: Un estudio de sus variantes, Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem, An ADMM-based interior-point method for large-scale linear programming, An alternative derivation of the projective interior point method for linear programming through the least squares approach, A Survey on Analog Models of Computation, A multiprocessor interior point algorithm, Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem, Primal-dual algorithms for linear programming based on the logarithmic barrier method, A reduced-gradient variant of Karmarkar's algorithm and null-space projections, A new linesearch method for quadratically constrained convex programming, Computational experience with a dual affine variant of Karmarkar's method for linear programming, Convergence results and numerical experiments on a linear programming hybrid algorithm, An interior-point algorithm for computing equilibria in economies with incomplete asset markets, On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods, An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming, A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems, Exploiting special structure in Karmarkar's linear programming algorithm, Nonlinear coordinate representations of smooth optimization problems, Computing Karmarkar projections quickly, The challenges of estimating the impact of distributed energy resources flexibility on the TSO/DSO boundary node operating points, On the complexity of a combined homotopy interior method for convex programming, A relaxed version of Karmarkar's method, A primal-dual interior-point method for linear programming based on a weighted barrier function, Linear programming and the Newton barrier flow, Perturbing the dual feasible region for solving convex quadratic programs, Recent developments in constrained optimization, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, A combined homotopy interior point method for convex nonlinear programming, Conical projection algorithms for linear programming, An interior point algorithm for nonlinear quantile regression, A relaxed primal-dual path-following algorithm for linear programming, The Newton modified barrier method for QP problems, Interior path following primal-dual algorithms. I: Linear programming, A polynomial-time algorithm for a class of linear complementarity problems, A primal-dual potential reduction method for problems involving matrix inequalities, A polynomial arc-search interior-point algorithm for linear programming, An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities, Primal-dual methods for linear programming, Solving a class of LP problems with a primal-dual logarithmic barrier method, PAL-Hom method for QP and an application to LP, Interior point methods 25 years later, Asymptotic behaviour of Karmarkar's method for linear programming, A ``build-down scheme for linear programming, Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis, A geometric property of the least squares solution of linear equations, A survey of dynamic network flows, On the improvement per iteration in Karmarkar's algorithm for linear programming, A noninterior path following algorithm for solving a class of multiobjective programming problems, On finding a vertex solution using interior point methods, Karmarkar's linear programming algorithm and Newton's method, A hybrid method for the nonlinear least squares problem with simple bounds, MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability, On the convex programming approach to linear programming, On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems, Interior point algorithms for linear programming with inequality constraints, A survey of search directions in interior point methods for linear programming, Computational results of an interior point algorithm for large scale linear programming, Complexity analysis of a linear complementarity algorithm based on a Lyapunov function, On the solution of linearly constrained optimization problems by means of barrier algorithms, Modified barrier functions (theory and methods), George B. Dantzig and systems optimization, Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming, A polynomial method of approximate centers for linear programming, Todd's low-complexity algorithm is a predictor-corrector path-following method, Projection algorithms for linear programming, A barrier method for dynamic Leontief-type linear programs, A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems, On the finite convergence of interior-point algorithms for linear programming, On combined phase 1-phase 2 projective methods for linear programming, OSQP: An Operator Splitting Solver for Quadratic Programs, Sparse QR factorization on a massively parallel computer, Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems, The steepest descent gravitational method for linear programming, Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints, Barrier function method and correction algorithms for improper convex programming problems, Exploiting special structure in a primal-dual path-following algorithm, Efficient solution of two-stage stochastic linear programs using interior point methods, An interior point method for quadratic programs based on conjugate projected gradients, Proximal methods in view of interior-point strategies, On the asymptotic behavior of the projective rescaling algorithm for linear programming, Vector processing in simplex and interior methods for linear programming, Parallel processors for planning under uncertainty, A class of polynomial variable metric algorithms for linear optimization, A conjugate gradient projection method for solving equations with convex constraints, Maintaining LU factors of a general sparse matrix, Quadratically constrained convex quadratic programmes: Faculty feasible regions, An implementation of Karmarkar's algorithm for linear programming, Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning, Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics, Lagrangian transformation and interior ellipsoid methods in convex optimization, An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation, A parallel interior point algorithm for linear programming on a network of transputers, 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, Splitting dense columns in sparse linear systems, A quadratically convergent method for linear programming, An \(O(n^ 3L)\) potential reduction algorithm for linear programming, On the classical logarithmic barrier function method for a class of smooth convex programming problems, Interior proximal point algorithm for linear programs, Deriving an unconstrained convex program for linear programming, Solving symmetric indefinite systems in an interior-point method for linear programming, On the number of iterations of Karmarkar's algorithm for linear programming, Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem, Active-set prediction for interior point methods using controlled perturbations


Uses Software


Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3026741&oldid=16053511"
Powered by MediaWiki