Pages that link to "Item:Q4015447"
From MaRDI portal
The following pages link to On the Implementation of a Primal-Dual Interior Point Method (Q4015447):
Displaying 50 items.
- A note on the dual treatment of higher-order regularization functionals (Q817017) (← links)
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
- Interior point method for long-term generation scheduling of large-scale hydrothermal systems (Q839779) (← links)
- Starting-point strategies for an infeasible potential reduction method (Q845561) (← links)
- Primal-dual nonlinear rescaling method for convex optimization (Q852150) (← links)
- Polynomial time second order mehrotra-type predictor--corrector algorithms (Q864824) (← links)
- Warm start by Hopfield neural networks for interior point methods (Q875399) (← links)
- A note on the use of vector barrier parameters for interior-point methods (Q877030) (← links)
- Artificial time integration (Q878202) (← links)
- Splines in higher order TV regularization (Q878255) (← links)
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms (Q881509) (← links)
- An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness (Q904955) (← links)
- On image reconstruction algorithms for binary electromagnetic geotomography (Q952472) (← links)
- An entropy regularization technique for minimizing a sum of Tchebycheff norms (Q969313) (← links)
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization (Q995953) (← links)
- Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions (Q997220) (← links)
- Note on implementing the new sphere method for LP using matrix inversions sparingly (Q1001333) (← links)
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
- Warmstarting for interior point methods applied to the long-term power planning problem (Q1011271) (← links)
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming (Q1012253) (← links)
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
- Further development of multiple centrality correctors for interior point methods (Q1029632) (← links)
- Penalty algorithm based on conjugate gradient method for solving portfolio management problem (Q1035576) (← links)
- SICOpt: Solution approach for nonlinear integer stochastic programming problems (Q1039361) (← links)
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method (Q1127255) (← links)
- On finding a vertex solution using interior point methods (Q1174841) (← links)
- An implementation of a parallel primal-dual interior point method for block- structured linear programs (Q1203072) (← links)
- Interior-point methods for convex programming (Q1205507) (← links)
- An interior point method for quadratic programs based on conjugate projected gradients (Q1260618) (← links)
- Warm start of the primal-dual method applied in the cutting-plane scheme (Q1290656) (← links)
- A parallel interior point algorithm for linear programming on a network of transputers (Q1309858) (← links)
- A primal-dual infeasible-interior-point algorithm for linear programming (Q1315419) (← links)
- Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems (Q1321337) (← links)
- Solving symmetric indefinite systems in an interior-point method for linear programming (Q1321659) (← links)
- Superlinear convergence of infeasible-interior-point methods for linear programming (Q1337141) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming (Q1338138) (← links)
- A predictor-corrector infeasible-interior-point algorithm for linear programming (Q1342276) (← links)
- Scaling, shifting and weighting in interior-point methods (Q1342881) (← links)
- Asymptotic convergence in a generalized predictor-corrector method (Q1352296) (← links)
- Fast convergence of the simplified largest step path following algorithm (Q1361106) (← links)
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← links)
- The largest step path following algorithm for monotone linear complementarity problems (Q1363413) (← links)
- Free material optimization via mathematical programming (Q1365069) (← links)
- Galton, Edgeworth, Frisch, and prospects for quantile regression in econometrics (Q1574221) (← links)
- Approximation in normed linear spaces (Q1587393) (← links)
- Higher-order derivatives in linear and quadratic programming (Q1592581) (← links)
- Interior-point methods (Q1593831) (← links)
- 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 (Q1596137) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
