HOPDM
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Convergence analysis of the inexact infeasible interior-point method for linear optimization
- Further development of multiple centrality correctors for interior point methods
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- Solving a class of LP problems with a primal-dual logarithmic barrier method
- Cost-effective sulphur emission reduction under uncertainty
- ALPO
- BPMPD
- Warm start of the primal-dual method applied in the cutting-plane scheme
- IPMLO
- LPABO
- QMRPACK
- QHOPDM -- a higher order primal-dual method for large scale convex quadratic programming
- Three qubit GHZ correlations and generalized Bell experiments
- MSLiP
- LOQO
- SLP-IOR
- Interactive specification and analysis of aspiration-based preferences.
- SDPpack
- QHOPDM
- LIPSOL
- PCx
- OOQP
- PDNET
- PGAPack
- MCMA
- nlpy
- IPM
- A homogeneous model for monotone mixed horizontal linear complementarity problems
- A primal-dual regularized interior-point method for convex quadratic programs
- Stabilization of Mehrotra's primal-dual algorithm and its implementation
- Multiple centrality corrections in a primal-dual method for linear programming
- Stabilization of interior-point methods for linear programming
- A note on two direct methods in linear programming
- Differentiable optimization and equation solving. A treatise on algorithmic science and the Karmarkar revolution
- Preconditioning indefinite systems in interior point methods for optimization
- ACCPM
- Experimental investigations in combining primal dual interior point method and simplex based LP solvers
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- ISAAP
- POSTS
- SLPTESTSET
- A predictor-corrector affine scaling method to train optimized extreme learning machine
- Block preconditioners for linear systems in interior point methods for convex constrained optimization
- OSL
- OOPS
- New developments in the primal-dual column generation technique
- Quasi-Newton approaches to interior point methods for quadratic problems
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- A coherent approach to Bayesian data envelopment analysis
- NETLIB LP Test Set
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- SUTIL
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems
- LOLIB
- A primal-dual interior-point algorithm for quadratic programming
- Some insights into the solution algorithms for SLP problems
- A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
- Inexact constraint preconditioners for linear systems arising in interior point methods
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- A note on the primal-dual column generation method for combinatorial optimization
- Practical piecewise-linear approximation for monotropic optimization
- A computational study of the use of an optimization-based method for simulating large multibody systems†
- Packing identical spheres into a cylinder
- Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
- Asymmetric multipartite Greenberger-Horne-Zeilinger states and Bell inequalities
- A Structure-Exploiting Tool in Algebraic Modeling Languages
- iOptimize
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- scientific article; zbMATH DE number 5007547 (Why is no real title available?)
- A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- A family of linear programming algorithms based on an algorithm by von Neumann
- Algorithm 539
- Implementing cholesky factorization for interior point methods of linear programming
- scientific article; zbMATH DE number 1186892 (Why is no real title available?)
- scientific article; zbMATH DE number 1187214 (Why is no real title available?)
- CHFACT
- Packing congruent hyperspheres into a hypersphere
- scientific article; zbMATH DE number 597812 (Why is no real title available?)
- Topology optimization of trusses with stress and local constraints on nodal stability and member intersection
- Extending Mehrotra and Gondzio higher order methods to mixed semidefinite-quadratic-linear programming
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Benchmarking interior point Lp/Qp solvers
- scientific article; zbMATH DE number 1746424 (Why is no real title available?)
- A preconditioning technique for Schur complement systems arising in stochastic optimization
- scientific article; zbMATH DE number 1783867 (Why is no real title available?)
- Adaptive Approximation of Young Measure Solutions in Scalar Nonconvex Variational Problems
- Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming
- scientific article; zbMATH DE number 6161573 (Why is no real title available?)
- A new warmstarting strategy for the primal-dual column generation method
- An affine scaling method using a class of differential barrier functions: primal approach
- A warm-start approach for large-scale stochastic linear programs
- Exploiting separability in large-scale linear support vector machine training
- Erratum to: Inexact constraint preconditioners for linear systems arising in interior point methods
- Modeling support for multistage recourse problems
- HyKKT: a hybrid direct-iterative method for solving KKT linear systems
- Building and solving large-scale stochastic programs on an affordable distributed computing system
- Two direct methods in linear programming
This page was built for software: HOPDM
