A cutting-plane algorithm with linear and geometric rates of convergence

DOI10.1007/BF00934337MaRDI QIDQ1147491zbMATH OpenOpenAlexFDO

Authors D. M. Topkins

Publication date 1981

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00934337

zbMATH Keywords

cutting-plane algorithmouter approximation methodslinear or geometric global rate of convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites work

• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3494173 (Why is no real title available?)
• scientific article; zbMATH DE number 3526459 (Why is no real title available?)
• scientific article; zbMATH DE number 3562783 (Why is no real title available?)
• scientific article; zbMATH DE number 3014451 (Why is no real title available?)
• scientific article; zbMATH DE number 3258269 (Why is no real title available?)
• scientific article; zbMATH DE number 3284926 (Why is no real title available?)
• scientific article; zbMATH DE number 3302906 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• scientific article; zbMATH DE number 3368489 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A central cutting plane algorithm for the convex programming problem
• A comparison of computational strategies for geometric programs
• Accelerating the Cutting Plane Method for Nonlinear Programming
• An Application of Error Bounds for Convex Programming in a Linear Space
• Applications of a general convergence theory for outer approximation algorithms
• Bimatrix Equilibrium Points and Mathematical Programming
• Comparison of generalized geometric programming algorithms
• Computational aspects of cutting-plane algorithms for geometric programming problems
• Convex Analysis
• Current state of the art of algorithms and computer software for geometric programming
• Cutting-Plane Methods without Nested Constraint Sets
• Infinitely constrained optimization problems
• 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
• On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
• On the numerical determination of the best approximations in the Chebyshev sense
• Rates of Stability in Nonlinear Programming
• Solution of generalized geometric programs
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• The Cutting-Plane Method for Solving Convex Programs
• The Progressive Support Method for Convex Programming
• The Supporting Hyperplane Method for Unimodal Programming

Cited in

(6)

• A cutting-plane method for quadratic semi infinite programming problems
• Some outer approximation methods for semi-infinite optimization problems
• Reflections on generating (disjunctive) cuts
• Accelerating the regularized decomposition method for two stage stochastic linear problems
• Efficient semidefinite branch-and-cut for MAP-MRF inference
• Monotone control laws for noisy, countable-state Markov chains

This page was built for publication: A cutting-plane algorithm with linear and geometric rates of convergence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1147491)