A central cutting plane algorithm for the convex programming problem

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
The Cutting-Plane Method for Solving Convex Programs
Elements of Large-Scale Mathematical Programming Part I: Concepts
Title not available (Why is that?)
Newton's method for convex programming and Tschebyscheff approximation
The Supporting Hyperplane Method for Unimodal Programming
Title not available (Why is that?)
Cutting-Plane Methods without Nested Constraint Sets
A Modified Linear Program for Columnar Methods in Mathematical Programming
Letter to the Editor—A Note on Cutting-Plane Methods Without Nested Constraint Sets
Nonlinear Programming: A Numerical Survey

Cited In (43)

A generalized projection-based scheme for solving convex constrained optimization problems
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
Learning lyapunov functions for hybrid systems
Implementation of an oracle-structured bundle method for distributed optimization
A cutting-plane algorithm with linear and geometric rates of convergence
Computational aspects of cutting-plane algorithms for geometric programming problems
Solving a continuous local access network design problem with a stabilized central column generation approach
Gradient-based local formulations of the Vickrey-Clarke-Groves mechanism for truthful minimization of social convex objectives
The proximal Chebychev center cutting plane algorithm for convex additive functions
Using an interior point method for the master problem in a decomposition approach
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
Rapidly convergent modification of the method of chebyshev centers
Semidefinite relaxations for semi-infinite polynomial programming
A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
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
A conflict-directed approach to chance-constrained mixed logical linear programming
Essentials of numerical nonsmooth optimization

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)