Pages that link to "Item:Q4229466"
From MaRDI portal
The following pages link to A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems (Q4229466):
Displaying 10 items.
- Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
- Recursive central rounding for mixed integer programs (Q336910) (← links)
- Analytic center cutting plane methods for variational inequalities over convex bodies (Q824529) (← links)
- A variable metric method for nonsmooth convex constrained optimization (Q865537) (← links)
- A filter-variable-metric method for nonsmooth convex constrained optimization (Q1004165) (← links)
- A path-following cutting plane method for some monotone variational inequalities<sup>∗</sup> (Q2709450) (← links)
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
- Homogeneous analytic center cutting plane methods with approximate centers (Q4504783) (← links)
- Polynomial Interior Point Cutting Plane Methods (Q4653547) (← links)
