Pages that link to "Item:Q4015447"

The following pages link to On the Implementation of a Primal-Dual Interior Point Method (Q4015447):

Displaying 50 items.

• Parallel interior-point method for linear and quadratic programs with special structure (Q1608140) (← links)
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
• Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions (Q1644105) (← links)
• An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277) (← links)
• Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems (Q1673895) (← links)
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
• An interior-point implementation developed and tuned for radiation therapy treatment planning (Q1687310) (← links)
• A high-precision single shooting method for solving hypersensitive optimal control problems (Q1721438) (← links)
• Maximal solutions of sparse analysis regularization (Q1730389) (← links)
• A homogeneous model for monotone mixed horizontal linear complementarity problems (Q1734775) (← links)
• A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones (Q1743538) (← links)
• Modelling the cracks produced by settlements in masonry structures (Q1750151) (← links)
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem (Q1760104) (← links)
• A primal-dual regularized interior-point method for convex quadratic programs (Q1762462) (← links)
• A new class of preconditioners for large-scale linear systems from interior point methods for linear programming (Q1765884) (← links)
• A starting point strategy for nonlinear interior methods. (Q1767154) (← links)
• Stabilization of Mehrotra's primal-dual algorithm and its implementation (Q1771347) (← links)
• A hybrid method of chaotic particle swarm optimization and linear interior for reactive power optimisation (Q1775925) (← links)
• Interior-point algorithm for linear optimization based on a new trigonometric kernel function (Q1785406) (← links)
• Symmetric indefinite systems for interior point methods (Q1803613) (← links)
• Exploiting special structure in a primal-dual path-following algorithm (Q1803615) (← links)
• On the convergence of the iteration sequence in primal-dual interior- point methods (Q1804356) (← links)
• Multiple centrality corrections in a primal-dual method for linear programming (Q1816400) (← links)
• A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
• Numerical aspects in developing LP softwares, LPAKO and LPABO (Q1872947) (← links)
• On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms (Q1890928) (← links)
• A generalized homogeneous and self-dual algorithm for linear programming (Q1904760) (← links)
• A primal-dual interior-point method for linear programming based on a weighted barrier function (Q1906738) (← links)
• An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
• The implementation of linear programming algorithms based on homotopies (Q1911465) (← links)
• Presolving in linear programming (Q1914076) (← links)
• Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
• A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence (Q1915908) (← links)
• A simplified homogeneous and self-dual linear programming algorithm and its implementation (Q1915910) (← links)
• A superquadratic infeasible-interior-point method for linear complementarity problems (Q1918925) (← links)
• On solving stochastic production planning problems via scenario modelling (Q1919106) (← links)
• Gigaflops in linear programming (Q1919182) (← links)
• A hybrid algorithm for the solution of a single commodity spatial equilibrium model (Q1919772) (← links)
• A predictor-corrector method for extended linear-quadratic programming (Q1919785) (← links)
• Primal-dual methods for linear programming (Q1924065) (← links)
• A new second-order corrector interior-point algorithm for semidefinite programming (Q1935927) (← links)
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones (Q1937004) (← links)
• A linear optimal transportation framework for quantifying and visualizing variations in sets of images (Q1943417) (← links)
• Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
• Solving \( L_1\)-CTA in 3D tables by an interior-point method for primal block-angular problems (Q1948525) (← links)
• Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints (Q1968617) (← links)
• Application of interior-point methods to model predictive control (Q1969532) (← links)
• Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949) (← links)