Pages that link to "Item:Q1099780"

The following pages link to Constrained global optimization: algorithms and applications (Q1099780):

Displaying 50 items.

• Application of Bayesian approach to numerical methods of global and stochastic optimization (Q1327427) (← links)
• On the solution and complexity of a generalized linear complementarity problem (Q1327430) (← links)
• A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
• On the role of continuously differentiable exact penalty functions in constrained global optimization (Q1330806) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• An algorithm for solving general D. C. programming problems (Q1332952) (← links)
• Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
• Convex programs with an additional constraint on the product of several convex functions (Q1333464) (← links)
• Multilinear programming: Duality theories (Q1336067) (← links)
• Lower bounds for the quadratic assignment problem (Q1339141) (← links)
• Global optimization conditions for certain nonconvex minimization problems (Q1342899) (← links)
• On the construction of test problems for concave minimization algorithms (Q1342905) (← links)
• On constrained infinite-time linear quadratic optimal control (Q1350170) (← links)
• Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
• Lagrange duality and partitioning techniques in nonconvex global optimization (Q1372558) (← links)
• On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
• Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. (Q1410623) (← links)
• Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) (← links)
• The search for substationarity points in the unilateral contact problems with nonmonotone friction. (Q1596840) (← links)
• Linearization method of global optimization for generalized geometric programming (Q1763283) (← links)
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
• An exact solution method for reliability optimization in complex systems (Q1772968) (← links)
• On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
• On the use of optimization models for portfolio selection: A review and some computational results (Q1890889) (← links)
• Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595) (← links)
• A relaxation method for nonconvex quadratically constrained quadratic programs (Q1892602) (← links)
• Verified solution of large systems and global optimization problems (Q1900761) (← links)
• Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
• Constructing large feasible suboptimal intervals for constrained nonlinear optimization (Q1904721) (← links)
• On the numerical treatment of nonconvex energy problems of mechanics (Q1905960) (← links)
• A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
• Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs (Q1906278) (← links)
• A new algorithm for solving the general quadratic programming problem (Q1908926) (← links)
• Delamination of composites as a substationarity problem: Numerical approximation and algorithms (Q1912174) (← links)
• Integral global minimization: Algorithms, implementations and numerical tests (Q1913610) (← links)
• An algorithm for maximizing a convex function over a simple set (Q1918984) (← links)
• Global optimization with a limited solution time (Q1918987) (← links)
• Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints (Q1921395) (← links)
• Characterizing global optimality for DC optimization problems under convex inequality constraints (Q1924070) (← links)
• Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems (Q1924614) (← links)
• An exact penalty function method for nonlinear mixed discrete programming problems (Q1936789) (← links)
• A new penalty parameter for linearly constrained 0--1 quadratic programming problems (Q1947625) (← links)
• A deterministic annealing algorithm for the minimum concave cost network flow problem (Q1952548) (← links)
• TABU search methodology in global optimization (Q1962982) (← links)
• \textsc{Oscars}-II: an algorithm for bound constrained global optimization (Q2022219) (← links)
• Exact dual bounds for some nonconvex minimax quadratic optimization problems (Q2043977) (← links)
• On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches (Q2084591) (← links)
• Hybrid limited memory gradient projection methods for box-constrained optimization problems (Q2111472) (← links)
• Measuring resetting of brain dynamics at epileptic seizures: application of global optimization and spatial synchronization techniques (Q2271131) (← links)
• A note on adapting methods for continuous global optimization to the discrete case (Q2276877) (← links)