A central cutting plane algorithm for the convex programming problem

From MaRDI portal

Publication:4081013

Jump to:navigation, search

DOI10.1007/BF01580439zbMath0318.90048MaRDI QIDQ4081013

Thomas Moore, Jack Elzinga

Publication date: 1975

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods in optimal control (49M99)

Related Items

Variations and extension of the convex-concave procedure, Some outer approximation methods for semi-infinite optimization problems, Improving the performance of the stochastic dual dynamic programming algorithm using Chebyshev centers, A modification of the inscribed ellipsoid method, Solving variational inequalities defined on a domain with infinitely many linear constraints, A logarithmic barrier cutting plane method for convex programming, Robust capacity assignment in telecommunications, The proximal Chebychev center cutting plane algorithm for convex additive functions, Implementing the simplex method as a cutting-plane method, with a view to regularization, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems, A conflict-directed approach to chance-constrained mixed logical linear programming, Convergence of the method of Chebyshev centers and some applications, Gradient-based local formulations of the Vickrey-Clarke-Groves mechanism for truthful minimization of social convex objectives, A cutting-plane algorithm with linear and geometric rates of convergence, A maximization method for a class of quasiconcave programs, Learning lyapunov functions for hybrid systems, An approach to robust network design in telecommunications, Solving a continuous local access network design problem with a stabilized central column generation approach, A cutting plane method for solving KYP-SDPs, Semidefinite relaxations for semi-infinite polynomial programming, Target radius methods for nonsmooth convex optimization, Numerical treatment of Bayesian robustness problems, An accelerated central cutting plane algorithm for linear semi-infinite programming, Logarithmic Barrier Decomposition Methods for Semi-infinite Programming, Computational aspects of cutting-plane algorithms for geometric programming problems, A generalized projection-based scheme for solving convex constrained optimization problems, Methods of Chebyshev points of convex sets and their applications, Essentials of numerical nonsmooth optimization, Linearization of McCormick relaxations and hybridization with the auxiliary variable method, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, A geometric characterization of ``optimality-equivalent relaxations, Implicit constraints handling for efficient search of feasible solutions, Imbedding and cutting methods for global optimization and their applications, Using an interior point method for the master problem in a decomposition approach, Chebyshev center based column generation, Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method, Methods of centers for variational inequalities and linear programming, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming, Rapidly convergent modification of the method of chebyshev centers, Essentials of numerical nonsmooth optimization

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4081013&oldid=17831373"