Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
From MaRDI portal
Publication:686998
Recommendations
- A branch and bound method mixed with cutting plane technique for solving concave quadratic programming problems
- A branch and bound algorithm for a class of non-convex programming problems
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
- scientific article; zbMATH DE number 433001
Cites work
- scientific article; zbMATH DE number 3961360 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 3494173 (Why is no real title available?)
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- A descent algorithm for nonsmooth convex optimization
- An Algorithm for Separable Nonconvex Programming Problems
- An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
- An Outer Approximation Algorithm for Solving General Convex Programs
- An algorithm for indefinite quadratic programming with convex constraints
- An algorithm for nonconvex programming problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Constrained global optimization: algorithms and applications
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Convergent Algorithms for Minimizing a Concave Function
- Cutting-Plane Methods without Nested Constraint Sets
- Decomposition Principle for Linear Programs
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Generation of large-scale quadratic programs for use as global optimization test problems
- Global minimization of a difference of two convex functions
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Jointly Constrained Biconvex Programming
- Method for minimizing a convex-concave function over a convex set
- Methods of descent for nondifferentiable optimization
- Newton's method for convex programming and Tschebyscheff approximation
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- On the convergence of a class of outer approximation algorithms for convex programs
- On the convergence of global methods in multiextremal optimization
- On the convergence of two branch-and-bound algorithms for nonconvex programming problems
- Outer approximation algorithm for nondifferentiable optimization problems
- Partitioning procedures for solving mixed-variables programming problems
- The Cutting-Plane Method for Solving Convex Programs
- The Supporting Hyperplane Method for Unimodal Programming
Cited in
(4)- 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
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
This page was built for publication: Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686998)
