Pages that link to "Item:Q3731373"
From MaRDI portal
The following pages link to Global minimization of large-scale constrained concave quadratic problems by separable programming (Q3731373):
Displaying 50 items.
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems (Q328518) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Maximizing strictly convex quadratic functions with bounded perturbations (Q639197) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization (Q656831) (← links)
- A generalized duality and applications (Q686992) (← links)
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications (Q811400) (← links)
- Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems (Q896176) (← links)
- A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837) (← links)
- Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds (Q922953) (← links)
- A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
- An effective linear approximation method for separable programming problems (Q1036545) (← links)
- Global minimization of indefinite quadratic problems (Q1092620) (← links)
- Enumerative techniques for solving some nonconvex global optimization problems (Q1102205) (← links)
- Parallel search algorithms in global optimization (Q1114315) (← links)
- A parallel algorithm for constrained concave quadratic global minimization (Q1116888) (← links)
- Method for minimizing a convex-concave function over a convex set (Q1176848) (← links)
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming (Q1184526) (← links)
- On nonconvex optimization problems with separated nonconvex variables (Q1187838) (← links)
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems (Q1321233) (← links)
- A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
- Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods (Q1719642) (← links)
- On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
- An algorithm for a class of nonlinear fractional problems using ranking of the vertices (Q1824995) (← links)
- An interval branch and bound algorithm for global optimization of a multiperiod pricing model (Q1894738) (← links)
- An algorithm for maximizing a convex function over a simple set (Q1918984) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\) (Q2093276) (← links)
- Piecewise linear bounding functions in univariate global optimization (Q2156897) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- D.c sets, d.c. functions and nonlinear equations (Q2367918) (← links)
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
- A decomposition approach for global optimum search in QP, NLP and MINLP problems (Q2638940) (← links)
- An algorithm for indefinite integer quadratic programming (Q2641219) (← links)
- A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
- On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← links)
- A variant of Tuy's decomposition algorithm for solving a class of concave minimization problems (Q3363075) (← links)
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming (Q3386779) (← links)
- On the Derivation of Continuous Piecewise Linear Approximating Functions (Q3386781) (← links)
- A decomposition method for the min concave cost flow problem with a staircase structure (Q3471825) (← links)
- (Q3690113) (← links)
