Global minimization of large-scale constrained concave quadratic problems by separable programming
From MaRDI portal
(Redirected from Publication:3731373)
Recommendations
- scientific article; zbMATH DE number 3913569
- A parallel algorithm for constrained concave quadratic global minimization
- A finite algorithm for global minimization of separable concave programs
- Global minimization algorithms for concave quadratic programming problems
- On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
Cites work
- A Successive Underestimation Method for Concave Minimization Problems
- A bilinear programming formulation of the 3-dimensional assignment problem
- An algorithm for nonconvex programming problems
- Characterization of linear complementarity problems as linear programs
- Construction of large-scale global minimum concave quadratic test problems
- Convergent Algorithms for Minimizing a Concave Function
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Maximization of A convex quadratic function under linear constraints
- Methods for Global Concave Minimization: A Bibliographic Survey
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
- Performance of approximate algorithms for global minimization
- Solving Large-Scale Zero-One Linear Programming Problems
- The quadratic assignment problem
Cited in
(55)- Duality bound method for the general quadratic programming problem with quadratic constraints
- A generalized duality and applications
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- D.c sets, d.c. functions and nonlinear equations
- LinA: a faster approach to piecewise linear approximations using corridors and its application to mixed-integer optimization
- Piecewise linear bounding functions in univariate global optimization
- On zero duality gap in nonconvex quadratic programming problems
- Method for minimizing a convex-concave function over a convex set
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
- A parallel algorithm for constrained concave quadratic global minimization
- A decomposition method for the min concave cost flow problem with a staircase structure
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
- An algorithm for indefinite integer quadratic programming
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- An interval branch and bound algorithm for global optimization of a multiperiod pricing model
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Jointly constrained bilinear programs and related problems: An overview
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
- A continuous approch for globally solving linearly constrained quadratic
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
- scientific article; zbMATH DE number 3913569 (Why is no real title available?)
- Subdeterminants and concave integer quadratic programming
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- Parallel search algorithms in global optimization
- Piecewise-linear approximations of multidimensional functions
- On the Derivation of Continuous Piecewise Linear Approximating Functions
- An algorithm for maximizing a convex function over a simple set
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- A computational comparison of some branch and bound methods for indefinite quadratic programs
- An algorithm for a class of nonlinear fractional problems using ranking of the vertices
- Global minimization of indefinite quadratic problems
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
- GLOMIQO: global mixed-integer quadratic optimizer
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Reduction of nonlinear integer separable programming problems∗
- An effective linear approximation method for separable programming problems
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- A new bound-and-reduce approach of nonconvex quadratic programming problems
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems
- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization
- A variant of Tuy's decomposition algorithm for solving a class of concave minimization problems
- A hybrid LP/NLP paradigm for global optimization relaxations
- Maximizing strictly convex quadratic functions with bounded perturbations
- Data-driven fair resource allocation for novel emerging epidemics: a COVID-19 Convalescent Plasma case study
- On approximation algorithms for concave mixed-integer quadratic programming
- On nonconvex optimization problems with separated nonconvex variables
- On approximation algorithms for concave mixed-integer quadratic programming
- A decomposition approach for global optimum search in QP, NLP and MINLP problems
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Enumerative techniques for solving some nonconvex global optimization problems
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
- Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods
This page was built for publication: Global minimization of large-scale constrained concave quadratic problems by separable programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3731373)
