Pages that link to "Item:Q4081013"
From MaRDI portal
The following pages link to A central cutting plane algorithm for the convex programming problem (Q4081013):
Displayed 23 items.
- Robust capacity assignment in telecommunications (Q867429) (← links)
- Numerical treatment of Bayesian robustness problems (Q962855) (← links)
- Methods of Chebyshev points of convex sets and their applications (Q1002938) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- A cutting-plane algorithm with linear and geometric rates of convergence (Q1147491) (← links)
- A maximization method for a class of quasiconcave programs (Q1148799) (← links)
- Using an interior point method for the master problem in a decomposition approach (Q1278995) (← links)
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) (← links)
- Methods of centers for variational inequalities and linear programming (Q1294369) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
- An accelerated central cutting plane algorithm for linear semi-infinite programming (Q1764241) (← links)
- A modification of the inscribed ellipsoid method (Q1900254) (← links)
- A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
- Solving variational inequalities defined on a domain with infinitely many linear constraints (Q2642631) (← links)
- An approach to robust network design in telecommunications (Q3515394) (← links)
- Imbedding and cutting methods for global optimization and their applications (Q3646085) (← links)
- Rapidly convergent modification of the method of chebyshev centers (Q3675910) (← links)
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs (Q3757690) (← links)
- Convergence of the method of Chebyshev centers and some applications (Q3768685) (← links)
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming (Q3842985) (← links)
- Computational aspects of cutting-plane algorithms for geometric programming problems (Q4149242) (← links)