Pages that link to "Item:Q3780011"
From MaRDI portal
The following pages link to An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions (Q3780011):
Displaying 34 items.
- A quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions (Q415217) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- New formulations of the multiple sequence alignment problem (Q628651) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- A successive linear approximation algorithm for the global minimization of a concave quadratic program (Q827382) (← links)
- Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- Quadratic functions with exponential number of local maxima (Q1079496) (← links)
- Penalty formulation for zero-one nonlinear programming (Q1091262) (← links)
- On a class of functions attaining their maximum at the vertices of a polyhedron (Q1115347) (← links)
- A parallel algorithm for constrained concave quadratic global minimization (Q1116888) (← links)
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms (Q1177911) (← links)
- An analytical approach to global optimization (Q1181733) (← links)
- On nonconvex optimization problems with separated nonconvex variables (Q1187838) (← links)
- A new reformulation-linearization technique for bilinear programming problems (Q1201905) (← links)
- Linear multiplicative programming (Q1207311) (← links)
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems (Q1321233) (← links)
- Minimization of a quadratic pseudo-Boolean function (Q1341991) (← links)
- An algorithm for global minimization of linearly constrained quadratic functions (Q1579950) (← links)
- Linearly constrained global minimization of functions with concave minorants (Q1918299) (← links)
- An algorithm for maximizing a convex function over a simple set (Q1918984) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- Sharp bounds for the maximum of the chi-square index in a class of contingency tables with given marginals (Q2563669) (← links)
- A decomposition approach for global optimum search in QP, NLP and MINLP problems (Q2638940) (← links)
- A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
- (Q3035144) (← links)
- An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints (Q3083314) (← links)
- Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints (Q3629524) (← links)
- (Q4380171) (← links)
- DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) (← links)
- (Q5460086) (← links)
- Rejoinder—A Gibbs Sampler for a Class of Random Convex Polytopes (Q6040679) (← links)
