Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
From MaRDI portal
Publication:686998
DOI10.1007/BF01096777zbMath0780.90088OpenAlexW1965810268MaRDI QIDQ686998
Publication date: 13 October 1993
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01096777
decompositionbranch-and-boundcutting planeglobal minimizationconvex-concave functionadaptive branchingrelaxation bounding
Related Items
Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions, ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS, Convex and concave relaxations of implicit functions, A new reformulation-linearization technique for bilinear programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of a class of outer approximation algorithms for convex programs
- On the convergence of global methods in multiextremal optimization
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Constrained global optimization: algorithms and applications
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Partitioning procedures for solving mixed-variables programming problems
- Newton's method for convex programming and Tschebyscheff approximation
- On the convergence of two branch-and-bound algorithms for nonconvex programming problems
- Method for minimizing a convex-concave function over a convex set
- An algorithm for indefinite quadratic programming with convex constraints
- Outer approximation algorithm for nondifferentiable optimization problems
- Methods of descent for nondifferentiable optimization
- Generation of large-scale quadratic programs for use as global optimization test problems
- Decomposition Principle for Linear Programs
- The Cutting-Plane Method for Solving Convex Programs
- A descent algorithm for nonsmooth convex optimization
- Jointly Constrained Biconvex Programming
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Global minimization of a difference of two convex functions
- Convergent Algorithms for Minimizing a Concave Function
- An Outer Approximation Algorithm for Solving General Convex Programs
- An algorithm for nonconvex programming problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- The Supporting Hyperplane Method for Unimodal Programming
- An Algorithm for Separable Nonconvex Programming Problems
- Cutting-Plane Methods without Nested Constraint Sets
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
