Pages that link to "Item:Q3200877"
From MaRDI portal
The following pages link to A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension (Q3200877):
Displaying 21 items.
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path (Q2467158) (← links)
- An algorithm for portfolio optimization with variable transaction costs. II: Computational analysis (Q2483030) (← links)
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems (Q2640436) (← links)
- An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints (Q2674577) (← links)
- Interior-point methods for linear programming: a review (Q3150491) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming (Q3176174) (← links)
- An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity (Q3444677) (← links)
- Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema (Q3835654) (← links)
- An unconstrained convex programming approach to solving convex quadratic programming problems (Q3835665) (← links)
- A Primal-dual affine scaling algorithm with necessary centering as a safeguard (Q4351192) (← links)
- A dynamic large-update primal‐dual interior-point method for linear optimization (Q4405939) (← links)
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems (Q4405940) (← links)
- Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants (Q4504778) (← links)
- On the symmetric affiine scaling algorithm for line programming<sup>*</sup> (Q4764582) (← links)
- A quadratically convergent scaling newton’s method for nonlinear complementarity problems (Q4836762) (← links)
- A quadratically convergent scaling newton’s method for nonlinear programming problems (Q4944414) (← links)
- A new potential reduction algorithm for smooth convex programming (Q4944415) (← links)
- An affine scaling method using a class of differential barrier functions: primal approach (Q5085230) (← links)
- Analysis of some interior point continuous trajectories for convex programming (Q5277955) (← links)
- A polynomial interior-point algorithm with improved iteration bounds for linear optimization (Q6498419) (← links)
- An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems (Q6541376) (← links)
