Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
From MaRDI portal
(Redirected from Publication:1106728)
Recommendations
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A globally convergent algorithm for nonlinearly constrained optimization problems
- On convergence of a global search strategy for reverse convex problems
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- scientific article; zbMATH DE number 2076008
- On the convergence of global methods in multiextremal optimization
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- Convexification and concavification methods for some global optimization problems
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- scientific article; zbMATH DE number 1300206
Cites work
- scientific article; zbMATH DE number 3910151 (Why is no real title available?)
- scientific article; zbMATH DE number 3718485 (Why is no real title available?)
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- A Successive Underestimation Method for Concave Minimization Problems
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A method for globally minimizing concave functions over convex sets
- A note on the convergence of an algorithm for nonconvex programming problems
- An Algorithm for Separable Nonconvex Programming Problems
- An algorithm for nonconvex programming problems
- An outer approximation method for globally minimizing a concave function over a compact convex set
- Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
- Constrained global optimization: algorithms and applications
- Convergent Algorithms for Minimizing a Concave Function
- Convex Analysis
- Convex programs with an additional reverse convex constraint
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- Global optimization under Lipschitzian constraints
- Globally convergent methods for n-dimensional multiextremal optimization
- Linear programs with an additional reverse convex constraint
- On outer approximation methods for solving concave minimization problems
- On the convergence of global methods in multiextremal optimization
- On the global minimization of concave functions
- Outer approximation algorithm for nondifferentiable optimization problems
- Reverse convex programming
- The cubic algorithm
Cited in
(48)- Separable concave minimization via partial outer approximation and branch and bound
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- Optimization methods for mixed integer weakly concave programming problems
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Mathematical programs with a two-dimensional reverse convex constraint
- Variations and extension of the convex-concave procedure
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems.
- DC decomposition of nonconvex polynomials with algebraic techniques
- Dual bounding procedures lead to convergent branch-and-bound algorithms
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Convergence of duality bound method in partly convex programming
- Decomposition approach for the global minimization of biconcave functions over polytopes
- On solving a d.c. programming problem by a sequence of linear programs
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Normal conical algorithm for concave minimization over polytopes
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- On the exhaustivity of simplicial partitioning
- GBSSS: The generalized big square small square method for planar single- facility location
- On the global minimization of a convex function under general nonconvex constraints
- On the topological complexity of DC-sets
- Hybrid approach for solving multiple-objective linear programs in outcome space
- Canonical DC programming problem: Outer approximation methods revisited
- A branch-and-reduce approach to global optimization
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs
- A note on adapting methods for continuous global optimization to the discrete case
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- Certified efficient global roundness evaluation
- A new simplicial cover technique in constrained global optimization
- Convex Maximization via Adjustable Robust Optimization
- Constrained, global optimization of unknown functions with Lipschitz continuous gradients
- On consistency of bounding operations in deterministic global optimization
- Outer approximation algorithms for canonical DC problems
- A modified proximal point method for DC functions on Hadamard manifolds
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities
- New LP bound in multivariate Lipschitz optimization: Theory and applications
- Methods for solving multi-extremal problems (global search)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- Performance of approximate algorithms for global minimization
This page was built for publication: Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106728)
