Pages that link to "Item:Q2066199"
From MaRDI portal
The following pages link to An infeasible interior-point arc-search algorithm for nonlinear constrained optimization (Q2066199):
Displaying 6 items.
- Infeasible/feasible search trajectories and directional rounding in integer programming (Q930155) (← links)
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path (Q2361136) (← links)
- An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the <b>N∞−</b> neighbourhood of the central path (Q3177455) (← links)
- A polynomial time infeasible interior-point arc-search algorithm for convex optimization (Q6173777) (← links)
- An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems (Q6541376) (← links)
- A robust optimization method with successive linear programming for intensity-modulated radiation therapy (Q6565297) (← links)
