Pages that link to "Item:Q1815078"
From MaRDI portal
The following pages link to A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078):
Displaying 14 items.
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) (← links)
- Complexity of some cutting plane methods that use analytic centers (Q1352301) (← links)
- An analytic center cutting plane method for pseudomonotone variational inequalities (Q1374377) (← links)
- A projection cutting plane algorithm for convex programming problems (Q1914623) (← links)
- A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
- On the circumcentered-reflection method for the convex feasibility problem (Q2661677) (← links)
- An anlytic center self-concordant cut method for the convex feasibility problem. (Q2768059) (← links)
- (Q4495139) (← links)
- Homogeneous analytic center cutting plane methods with approximate centers (Q4504783) (← links)
- Polynomial Interior Point Cutting Plane Methods (Q4653547) (← links)
- Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities (Q4702306) (← links)
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems (Q4785865) (← links)
- Distributionally robust portfolio optimization with second-order stochastic dominance based on Wasserstein metric (Q6125219) (← links)
