On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
From MaRDI portal
Recommendations
Cites work
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- A note on solution of large sparse maximum entropy problems with linear equality constraints
- A set of staircase linear programming test problems
- An experimental approach to karmarkar’s projective method for linear programming
- An extension of Karmarkar's algorithm for linear programming using dual variables
- Computational Experience in Solving Linear Programs
- Confidence levels using noral approxiation to modifiedt-Statistics for dependent Variables
- Convergence bounds for nonlinear programming algorithms
- Formal optimization of some reduced linear programming problems
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3137859 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3819056 (Why is no real title available?)
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 3253619 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3309658 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3388498 (Why is no real title available?)
- scientific article; zbMATH DE number 3423826 (Why is no real title available?)
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Maintaining LU factors of a general sparse matrix
- Modification of the minimum-degree algorithm by multiple elimination
- Numerical Methods for Large Sparse Linear Least Squares Problems
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Solving staircase linear programs by the simplex method, 1: Inversion
- Sparse Matrix Methods in Optimization
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Trajectory analysis and extrapolation in barrier function methods
- Yale sparse matrix package I: The symmetric codes
Cited in
(only showing first 100 items - show all)- A reduced-gradient variant of Karmarkar's algorithm and null-space projections
- 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
- A multiplicative barrier function method for linear programming
- Exploiting special structure in Karmarkar's linear programming algorithm
- Computing Karmarkar projections quickly
- A relaxed version of Karmarkar's method
- Linear programming and the Newton barrier flow
- Recent developments in constrained optimization
- Conical projection algorithms for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- Solving a class of LP problems with a primal-dual logarithmic barrier method
- 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
- On the convex programming approach to linear programming
- 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
- Modified barrier functions (theory and methods)
- 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 combined phase 1-phase 2 projective methods for linear programming
- An interior point method for quadratic programs based on conjugate projected gradients
- Proximal methods in view of interior-point strategies
- Quadratically constrained convex quadratic programmes: Faculty feasible regions
- A parallel interior point algorithm for linear programming on a network of transputers
- Degeneracy in interior point methods for linear programming: A survey
- 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
- Primal-dual algorithms for linear programming based on the logarithmic barrier method
- A new linesearch method for quadratically constrained convex programming
- Perturbing the dual feasible region for solving convex quadratic programs
- A combined homotopy interior point method for convex nonlinear programming
- Residual functions in iteration process of barrier-Newton method in solving general problem of linear programming
- Analysis of the convergence of a class of barrier projection methods for linear programming problems
- The role of linear objective functions in barrier methods
- Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics
- 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
- The challenges of estimating the impact of distributed energy resources flexibility on the TSO/DSO boundary node operating points
- A noninterior path following algorithm for solving a class of multiobjective programming problems
- Exploiting special structure in a primal-dual path-following algorithm
- Efficient solution of two-stage stochastic linear programs using interior point methods
- A class of polynomial variable metric algorithms for linear optimization
- Maintaining LU factors of a general sparse matrix
- An implementation of Karmarkar's algorithm for linear programming
- Barrier-projective methods for nonlinear programming
- Nonlinear coordinate representations of smooth optimization problems
- A primal-dual interior-point method for linear programming based on a weighted barrier function
- 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
- A primal-dual potential reduction method for problems involving matrix inequalities
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Primal-dual methods for linear programming
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
- On the solution of linearly constrained optimization problems by means of barrier algorithms
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems
- A conjugate gradient projection method for solving equations with convex constraints
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- Lagrangian transformation and interior ellipsoid methods in convex optimization
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- PAL-Hom method for QP and an application to LP
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
- Active-set prediction for interior point methods using controlled perturbations
- 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
- 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 method of quasi-solutions based on barrier functions in the analysis of improper convex programs
- 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
- Symbolic implementation of interior point method for linear programming problem
- scientific article; zbMATH DE number 4211801 (Why is no real title available?)
- El metodo de Karmarkar: Un estudio de sus variantes
- scientific article; zbMATH DE number 4151220 (Why is no real title available?)
- Dual barrier functions with superfast rates of convergence for the linear programming problem
- A variable-metric variant of the Karmarkar algorithm for linear programming
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- scientific article; zbMATH DE number 4049377 (Why is no real title available?)
- The Projective SUMT Method for Convex Programming
- Implementing cholesky factorization for interior point methods of linear programming
- Linear programming by minimizing distances
- An unconstrained convex programming view of linear programming
- Insights into the interior-point methods
- A multiprocessor interior point algorithm
This page was built for publication: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026741)
