scientific article; zbMATH DE number 757677

V. Visweswaran, Christodoulos A. Floudas

Publication date: 23 May 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

bilinear programming concave programming indefinite quadratic bound constrained and large scale quadratic problems quadratic test problems

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Global optimality conditions for nonconvex minimization problems with quadratic constraints, A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, Computation of general correlation coefficients for interval data, Overlapping radial basis function interpolants for spectrally accurate approximation of functions of eigenvalues with application to buckling of composite plates, Solution to nonconvex quadratic programming with both inequality and box constraints, Call option price function in Bernstein polynomial basis with no-arbitrage inequality constraints, Bilinear modeling solution approach for fixed charge network flow problems, A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming, A combinatorial optimization approach to scenario filtering in portfolio selection, Solving generalized polynomial problem by using new affine relaxed technique, Optimality conditions and optimization methods for quartic polynomial optimization, On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming, Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems, On generalized geometric programming problems with non-positive variables, A new rectangle branch-and-pruning approach for generalized geometric programming, On the microeconomic foundations of linear demand for differentiated products, New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems, Global optimization algorithm for solving linear multiplicative programming problems, Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation, Global optimization over a box via canonical dual function, Global optimization of bilinear programs with a multiparametric disaggregation technique, On box constrained concave quadratic optimization, A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables, A new global algorithm for factor-risk-constrained mean-variance portfolio selection, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, A new global optimization algorithm for solving generalized geometric programming, The profit maximization problem in economies of scale, Sufficient global optimality conditions for weakly convex minimization problems, A global optimization using linear relaxation for generalized geometric programming, Separation and relaxation for cones of quadratic forms, Global optimal solutions to a class of quadrinomial minimization problems with one quadratic constraint, Effective algorithms for optimal portfolio deleveraging problem with cross impact, Reduced RLT representations for nonconvex polynomial programming problems, An LPCC approach to nonconvex quadratic programs, Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints, Maximizing strictly convex quadratic functions with bounded perturbations, Solution to singular optimal control by backward differential flow, Randomized Algorithms for Lexicographic Inference, A global optimization algorithm for signomial geometric programming problem, Global optimization of signomial geometric programming using linear relaxation., Global maximization of a generalized concave multiplicative function, Global minimization of difference of quadratic and convex functions over box or binary constraints, Maximization of a PSD quadratic form and factorization, A computational comparison of some branch and bound methods for indefinite quadratic programs, Penalized and Constrained Optimization: An Application to High-Dimensional Website Advertising, Global optimality conditions and optimization methods for polynomial programming problems, Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization, A fully general, exact algorithm for nesting irregular shapes, A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations, Duality bound method for the general quadratic programming problem with quadratic constraints, Accelerating method of global optimization for signomial geometric programming, Applying the canonical dual theory in optimal control problems, Global optimization by canonical dual function, An outcome space approach for generalized convex multiplicative programs, Global optimality conditions for some classes of optimization problems, A new algorithm for concave quadratic programming, A new linearization technique for multi-quadratic 0-1 programming problems., Solution to an optimal control problem via canonical dual method, Solutions to quadratic minimization problems with box and integer constraints, A global optimization algorithm using linear relaxation, Quadratic maximization of reachable values of affine systems with diagonalizable matrix, Mathematical properties of optimization problems defined by positively homogeneous functions, Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma, A study on concave optimization via canonical dual function, Subdeterminants and Concave Integer Quadratic Programming, On approximation algorithms for concave mixed-integer quadratic programming, A branch and bound algorithm for globally solving a class of nonconvex programming problems, Optimal solutions to a class of nonconvex minimization problems with linear inequality constraints, An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation, Global optimality condition for quadratic optimization problems under data uncertainty, A new concave minimization algorithm for the absolute value equation solution, Bidimensional packing by bilinear programming, Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, Global optimality conditions for nonlinear programming problems with linear equality constraints, A technique for adaptive scheduling of soft real-time tasks