Pages that link to "Item:Q5953365"
From MaRDI portal
The following pages link to A potential reduction algorithm for linearly constrained convex programming (Q5953365):
Displaying 15 items.
- An active-set strategy in an interior point method for linear programming (Q687036) (← links)
- On lower bound updates in primal potential reduction methods for linear programming (Q1181907) (← links)
- A primal-dual affine-scaling potential-reduction algorithm for linear programming (Q1321668) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Potential reduction algorithms for structured combinatorial optimization problems (Q1373458) (← links)
- Potential reduction method for harmonically convex programming (Q1893464) (← links)
- On convex optimization with linear constraints (Q1905040) (← links)
- A potential reduction method for the generalized linear complementarity problem over a polyhedral cone (Q2269759) (← links)
- A potential reduction algorithm for monotone variational inequality problems (Q2721906) (← links)
- Robust reduction of a class of large-scale linear programs (Q2784411) (← links)
- (Q4792349) (← links)
- (Q4838856) (← links)
- A combination of potential reduction steps and steepest descent steps for solving convex programming problems (Q5317840) (← links)
- A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems (Q5492637) (← links)
- A potential-reduction algorithm for linear complementarity problems (Q5697858) (← links)