Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
From MaRDI portal
Publication:4227923
DOI10.1080/10556789808805699zbMath0916.90208OpenAlexW2006884874MaRDI QIDQ4227923
Publication date: 2 February 1999
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789808805699
interior-point algorithmslarge-scale linear programmingprimal-dual infeasible-interior-point algorithm
Related Items (39)
A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP ⋮ The convergence of an interior-point method using modified search directions in final iterations ⋮ Infeasible interior-point methods for linear optimization based on large neighborhood ⋮ Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy ⋮ A finite termination Mehrotra-type predictor-corrector algorithm ⋮ Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking ⋮ An interior-point approach for primal block-angular problems ⋮ Polynomial time second order mehrotra-type predictor--corrector algorithms ⋮ Warm start by Hopfield neural networks for interior point methods ⋮ A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils ⋮ Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data ⋮ Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms ⋮ A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming ⋮ Topology optimization design of 3D electrothermomechanical actuators by using GPU as a co-processor ⋮ PAL-Hom method for QP and an application to LP ⋮ A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan ⋮ Efficient GPU-based implementations of simplex type algorithms ⋮ Hopfield neural networks in large-scale linear optimization problems ⋮ Solving \( L_1\)-CTA in 3D tables by an interior-point method for primal block-angular problems ⋮ The effect of nanoparticle conglomeration on the overall conductivity of nanocomposites ⋮ Mehrotra-type predictor-corrector algorithm revisited ⋮ Interior Point Methods for Nonlinear Optimization ⋮ Stabilization of Mehrotra's primal-dual algorithm and its implementation ⋮ A Mehrotra type predictor-corrector interior-point algorithm for linear programming ⋮ Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization ⋮ Symbolic implementation of interior point method for linear programming problem ⋮ A SELF-REGULAR NEWTON BASED ALGORITHM FOR LINEAR OPTIMIZATION ⋮ The complexity of self-regular proximity based infeasible IPMs ⋮ A predictor-corrector algorithm for linear optimization based on a modified Newton direction ⋮ Shape optimization of piezoelectric sensors or actuators for the control of plates ⋮ Augmented sparse reconstruction of protein signaling networks ⋮ A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION ⋮ On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems ⋮ Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning ⋮ A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs ⋮ User'S guide To Lipsol linear-programming interior point solvers V0.4 ⋮ Improving an interior-point approach for large block-angular problems by hybrid preconditioners ⋮ Active-set prediction for interior point methods using controlled perturbations ⋮ Fast Core Pricing for Rich Advertising Auctions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Further Development of a Primal-Dual Interior Point Method
- On Finding Supernodes for Sparse Matrix Computations
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method
This page was built for publication: Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
