A central cutting plane algorithm for the convex programming problem
From MaRDI portal
Publication:4081013
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3526459 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- A Modified Linear Program for Columnar Methods in Mathematical Programming
- Cutting-Plane Methods without Nested Constraint Sets
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
- Newton's method for convex programming and Tschebyscheff approximation
- Nonlinear Programming: A Numerical Survey
- The Cutting-Plane Method for Solving Convex Programs
- The Supporting Hyperplane Method for Unimodal Programming
Cited in
(43)- A conflict-directed approach to chance-constrained mixed logical linear programming
- A generalized projection-based scheme for solving convex constrained optimization problems
- Essentials of numerical nonsmooth optimization
- Some outer approximation methods for semi-infinite optimization problems
- Target radius methods for nonsmooth convex optimization
- Numerical treatment of Bayesian robustness problems
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- Robust capacity assignment in telecommunications
- Variations and extension of the convex-concave procedure
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- A logarithmic barrier cutting plane method for convex programming
- Essentials of numerical nonsmooth optimization
- An approach to robust network design in telecommunications
- Improving the performance of the stochastic dual dynamic programming algorithm using Chebyshev centers
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method
- Methods of Chebyshev points of convex sets and their applications
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- Methods of centers for variational inequalities and linear programming
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
- A maximization method for a class of quasiconcave programs
- A geometric characterization of ``optimality-equivalent relaxations
- Solving variational inequalities defined on a domain with infinitely many linear constraints
- Imbedding and cutting methods for global optimization and their applications
- Implicit constraints handling for efficient search of feasible solutions
- A cutting plane method for solving KYP-SDPs
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
- Chebyshev center based column generation
- A cutting-plane algorithm with linear and geometric rates of convergence
- Learning lyapunov functions for hybrid systems
- Computational aspects of cutting-plane algorithms for geometric programming problems
- Implementation of an oracle-structured bundle method for distributed optimization
- Solving a continuous local access network design problem with a stabilized central column generation approach
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- Using an interior point method for the master problem in a decomposition approach
- Gradient-based local formulations of the Vickrey-Clarke-Groves mechanism for truthful minimization of social convex objectives
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- Semidefinite relaxations for semi-infinite polynomial programming
- Rapidly convergent modification of the method of chebyshev centers
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- A modification of the inscribed ellipsoid method
- Convergence of the method of Chebyshev centers and some applications
This page was built for publication: A central cutting plane algorithm for the convex programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4081013)
