Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
From MaRDI portal
Publication:4227923
Recommendations
- Interior point methods for large-scale linear programming
- scientific article; zbMATH DE number 1047679
- Interior-point methods with decomposition for solving large-scale linear programs
- Computational results of an interior point algorithm for large scale linear programming
- Interior point methods for large-scale nonlinear programming
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- Inner solvers for interior point methods for large scale nonlinear programming
- Large-Step Interior Point Algorithms for Linear Complementarity Problems
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
Cites work
- A new polynomial-time algorithm for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Further Development of a Primal-Dual Interior Point Method
- scientific article; zbMATH DE number 4049374 (Why is no real title available?)
- scientific article; zbMATH DE number 1047679 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On Finding Supernodes for Sparse Matrix Computations
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- On the Implementation of a Primal-Dual Interior Point Method
- The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method
Cited in
(42)- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming
- Stabilization of Mehrotra's primal-dual algorithm and its implementation
- Augmented sparse reconstruction of protein signaling networks
- The convergence of an interior-point method using modified search directions in final iterations
- Solving L₁-CTA in 3D tables by an interior-point method for primal block-angular problems
- On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems
- The effect of nanoparticle conglomeration on the overall conductivity of nanocomposites
- A Mehrotra type predictor-corrector interior-point algorithm for linear programming
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- A finite termination Mehrotra-type predictor-corrector algorithm
- Topology optimization design of 3D electrothermomechanical actuators by using GPU as a co-processor
- PAL-Hom method for QP and an application to LP
- The complexity of self-regular proximity based infeasible IPMs
- A predictor-corrector algorithm for linear optimization based on a modified Newton direction
- Active-set prediction for interior point methods using controlled perturbations
- Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
- An interior-point approach for primal block-angular problems
- A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils
- Symbolic implementation of interior point method for linear programming problem
- A self-regular Newton based algorithm for linear optimization
- Infeasible interior-point methods for linear optimization based on large neighborhood
- Shape optimization of piezoelectric sensors or actuators for the control of plates
- Mehrotra-type predictor-corrector algorithm revisited
- Interior Point Methods for Nonlinear Optimization
- A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION
- Hopfield neural networks in large-scale linear optimization problems
- User'S guide To Lipsol linear-programming interior point solvers V0.4
- Benchmarking interior point Lp/Qp solvers
- Fast Core Pricing for Rich Advertising Auctions
- A Mehrotra type predictor-corrector interior-point method for \(P_\ast(\kappa)\)-HLCP
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
- Primal-dual path-following methods and the trust-region updating strategy for linear programming with noisy data
- A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan
- A three-term conjugate gradient-type method with sufficient descent property for vector optimization
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- Solving random hyperbolic conservation laws using linear programming
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- Warm start by Hopfield neural networks for interior point methods
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
- Efficient GPU-based implementations of simplex type algorithms
This page was built for publication: Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4227923)
