Pages that link to "Item:Q3879055"

The following pages link to A note on the convergence of an algorithm for nonconvex programming problems (Q3879055):

Displaying 16 items.

• On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
• On the convexification of nonlinear programming problems: An applications-oriented survey (Q799590) (← links)
• On the global minimization of concave functions (Q800693) (← links)
• Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
• Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
• A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
• Bisecton by global optimization revisited (Q965055) (← links)
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization (Q1067978) (← links)
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization (Q1090607) (← links)
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
• On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
• A new simplicial cover technique in constrained global optimization (Q1187367) (← links)
• Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
• Deletion-by-infeasibility rule for DC-constrained global optimization (Q1893323) (← links)
• On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
• Applications of Toland's duality theory to nonconvex optimization problems (Q3983482) (← links)