Pages that link to "Item:Q808184"
From MaRDI portal
The following pages link to Computational experience with a primal-dual interior point method for linear programming (Q808184):
Displaying 50 items.
- An interior point potential reduction method for constrained equations (Q1814789) (← links)
- The convergence of an interior-point method using modified search directions in final iterations (Q1886472) (← links)
- Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function (Q1904656) (← 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)
- The implementation of linear programming algorithms based on homotopies (Q1911465) (← links)
- A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems (Q1913863) (← links)
- Presolving in linear programming (Q1914076) (← links)
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs (Q1915903) (← links)
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904) (← links)
- An infeasible-interior-point algorithm using projections onto a convex set (Q1915905) (← links)
- A relaxed primal-dual path-following algorithm for linear programming (Q1915911) (← links)
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms (Q1915913) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- An interior point method for general large-scale quadratic programming problems (Q1915920) (← links)
- Gigaflops in linear programming (Q1919182) (← links)
- Primal-dual methods for linear programming (Q1924065) (← links)
- An incremental primal-dual method for nonlinear programming with special structure (Q1936792) (← links)
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming (Q1989949) (← links)
- An interior-point algorithm for linear programming with optimal selection of centering parameter and step size (Q2059175) (← links)
- An infeasible interior-point arc-search algorithm for nonlinear constrained optimization (Q2066199) (← links)
- Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
- On the convergence of a predictor-corrector variant algorithm (Q2355008) (← links)
- Combining phase I and phase II in a potential reduction algorithm for linear programming (Q2368075) (← links)
- Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
- The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
- An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints (Q2674577) (← links)
- Solving quadratically constrained convex optimization problems with an interior-point method (Q3093053) (← links)
- (Q3348699) (← links)
- On the Implementation of a Primal-Dual Interior Point Method (Q4015447) (← links)
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming (Q4019974) (← links)
- Further Development of a Primal-Dual Interior Point Method (Q4025908) (← links)
- Solving large-scale linear programs by interior-point methods under the Matlab<sup>∗</sup>Environment<sup>†</sup> (Q4227923) (← links)
- A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables (Q4317664) (← links)
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems (Q4405940) (← links)
- The BPMPD interior point solver for convex quadratic problems (Q4504788) (← links)
- LOQO:an interior point code for quadratic programming (Q4504789) (← links)
- Conic convex programming and self-dual embedding (Q4525130) (← links)
- On a dual method for a specially structured linear programming problem with application to stochastic programming (Q4709734) (← links)
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
- A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗ (Q4819970) (← links)
- A logarithm barrier method for linear programming (Q4935392) (← links)
- A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood (Q4988920) (← links)
- (Q5020878) (← links)
- Primal-Dual Interior-Point Methods for Domain-Driven Formulations (Q5119848) (← links)
- (Q5158552) (← links)
- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds (Q5691011) (← links)
- A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems (Q5892653) (← links)
- A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems (Q5892655) (← links)
- On using exterior penalty approaches for solving linear programming problems (Q5945315) (← links)
