Optimization methods for mixed integer weakly concave programming problems
From MaRDI portal
Publication:489113
DOI10.1007/s40305-014-0046-yzbMath1305.90340OpenAlexW2026940416MaRDI QIDQ489113
Yong-jian Yang, Feng Jiang, Fu-Sheng Bai, Zhi-You Wu
Publication date: 27 January 2015
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-014-0046-y
global optimality conditionsglobal optimization methodlocal optimization methodmixed integer weakly concave programming problems
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A novel filled function method and quasi-filled function method for global optimization
- Global minimization of difference of quadratic and convex functions over box or binary constraints
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Regularity and stability for the mathematical programming problem in Banach spaces
- An improved branch and bound algorithm for mixed integer nonlinear programs
- Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
- Solving mixed integer nonlinear programs by outer approximation
- Handbook of global optimization
- On the construction of test problems for concave minimization algorithms
- Constrained discriminant analysis via \(0/1\) mixed integer programming
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- Handbook of global optimization. Vol. 2
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- A branch-and-cut method for 0-1 mixed convex programming
- Sufficient global optimality conditions for weakly convex minimization problems
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Strong and Weak Convexity of Sets and Functions
- Global optimality conditions for mixed nonconvex quadratic programs†
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- Quadratic knapsack problems
- A Successive Underestimation Method for Concave Minimization Problems
- Introduction to global optimization.
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
