On the Implementation of a Primal-Dual Interior Point Method
From MaRDI portal
Publication:4015447
DOI10.1137/0802028zbMath0773.90047WikidataQ59411976 ScholiaQ59411976MaRDI QIDQ4015447
Publication date: 13 January 1993
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0802028
90C06: Large-scale problems in mathematical programming
90C05: Linear programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Experiments with a hybrid interior point/combinatorial approach for network flow problems, An easy way to teach interior-point methods., Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme, Solving linear systems in interior-point methods, SDPT3 — A Matlab software package for semidefinite programming, Version 1.3, Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method, The analyticity of interior-point-paths at strictly complementary solutions of linear programs, A dynamic large-update primal‐dual interior-point method for linear optimization, Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables, A study of search directions in primal-dual interior-point methods for semidefinite programming, Extending Mehrotra and Gondzio higher order methods to mixed semidefinite-quadratic-linear programming, Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants, Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization, User'S guide To Lipsol linear-programming interior point solvers V0.4, PCx: an interior-point code for linear programming, The BPMPD interior point solver for convex quadratic problems, LOQO:an interior point code for quadratic programming, Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming, Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones, Benchmarking interior point Lp/Qp solvers, A self-adjusting primal–dual interior point method for linear programs, Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem, SOLVING LARGE SCALE LINEAR PROGRAMMING PROBLEMS USING AN INTERIOR POINT METHOD ON A MASSIVELY PARALLEL SIMD COMPUTER, A logarithm barrier method for linear programming, An adaptive self-regular proximity-based large-update IPM for LO, Identifying superfluous constraints within an interior-point algorithm for convex quadratic programming, A note on the dual treatment of higher-order regularization functionals, Primal-dual nonlinear rescaling method for convex optimization, Polynomial time second order mehrotra-type predictor--corrector algorithms, Warm start by Hopfield neural networks for interior point methods, A note on the use of vector barrier parameters for interior-point methods, Artificial time integration, Splines in higher order TV regularization, Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms, Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization, Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions, HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method, On finding a vertex solution using interior point methods, An implementation of a parallel primal-dual interior point method for block- structured linear programs, Interior-point methods for convex programming, An interior point method for quadratic programs based on conjugate projected gradients, Warm start of the primal-dual method applied in the cutting-plane scheme, A parallel interior point algorithm for linear programming on a network of transputers, A primal-dual infeasible-interior-point algorithm for linear programming, Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems, Solving symmetric indefinite systems in an interior-point method for linear programming, Superlinear convergence of infeasible-interior-point methods for linear programming, Primal-dual algorithms for linear programming based on the logarithmic barrier method, Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming, A predictor-corrector infeasible-interior-point algorithm for linear programming, Scaling, shifting and weighting in interior-point methods, Asymptotic convergence in a generalized predictor-corrector method, Fast convergence of the simplified largest step path following algorithm, Improved complexity using higher-order correctors for primal-dual Dikin affine scaling, The largest step path following algorithm for monotone linear complementarity problems, Free material optimization via mathematical programming, Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics, Approximation in normed linear spaces, Higher-order derivatives in linear and quadratic programming, Interior-point methods, 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, Advances in design and implementation of optimization software, Parallel interior-point method for linear and quadratic programs with special structure, A new class of preconditioners for large-scale linear systems from interior point methods for linear programming, A starting point strategy for nonlinear interior methods., Stabilization of Mehrotra's primal-dual algorithm and its implementation, A hybrid method of chaotic particle swarm optimization and linear interior for reactive power optimisation, Symmetric indefinite systems for interior point methods, Exploiting special structure in a primal-dual path-following algorithm, Multiple centrality corrections in a primal-dual method for linear programming, A new class of polynomial primal-dual methods for linear and semidefinite optimization, Numerical aspects in developing LP softwares, LPAKO and LPABO, On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms, A generalized homogeneous and self-dual algorithm for linear programming, A primal-dual interior-point method for linear programming based on a weighted barrier function, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, The implementation of linear programming algorithms based on homotopies, Presolving in linear programming, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence, A simplified homogeneous and self-dual linear programming algorithm and its implementation, A superquadratic infeasible-interior-point method for linear complementarity problems, On solving stochastic production planning problems via scenario modelling, Gigaflops in linear programming, A hybrid algorithm for the solution of a single commodity spatial equilibrium model, A predictor-corrector method for extended linear-quadratic programming, Primal-dual methods for linear programming, Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints, Application of interior-point methods to model predictive control, Theoretical convergence of large-step primal-dual interior point algorithms for linear programming, A finite termination Mehrotra-type predictor-corrector algorithm, Steplength selection in interior-point methods for quadratic programming, The \(Q\) method for second order cone programming, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, A primal-dual interior-point algorithm for quadratic programming, The complexity of self-regular proximity based infeasible IPMs, An efficient support vector machine learning method with second-order cone programming for large-scale problems, Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods, Interior-point methods for linear programming: a review, Computation of capacity, Detection of Subsurface Bubbles with Discrete Electromagnetic Geotomography, An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity, Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
Uses Software
