Pages that link to "Item:Q4105518"

The following pages link to An algorithm for nonconvex programming problems (Q4105518):

Displaying 50 items.

• A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm (Q286595) (← links)
• A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies (Q427360) (← links)
• An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem (Q427361) (← links)
• On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
• Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
• An algorithm for solving convex programs with an additional convex- concave constraint (Q689151) (← links)
• On the global optimization of sums of linear fractional functions over a convex set (Q704748) (← links)
• A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision (Q721144) (← links)
• A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243) (← links)
• On the convexification of nonlinear programming problems: An applications-oriented survey (Q799590) (← links)
• On the global minimization of concave functions (Q800693) (← links)
• Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
• Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
• Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
• Interval branch and bound with local sampling for constrained global optimization (Q811876) (← links)
• Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
• Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems (Q868630) (← links)
• A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
• Bisecton by global optimization revisited (Q965055) (← links)
• A fast memoryless interval-based algorithm for global optimization (Q975771) (← links)
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization (Q1067978) (← links)
• Convex programs with an additional reverse convex constraint (Q1071651) (← links)
• On the convergence of global methods in multiextremal optimization (Q1078082) (← 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)
• Quadratic problems defined on a convex hull of points (Q1102708) (← links)
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
• Minimizing a quasi-concave function subject to a reverse convex constraint (Q1108198) (← links)
• On the global minimization of a convex function under general nonconvex constraints (Q1111474) (← links)
• A parallel algorithm for constrained concave quadratic global minimization (Q1116888) (← links)
• Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems (Q1122325) (← links)
• On the convergence of two branch-and-bound algorithms for nonconvex programming problems (Q1149236) (← links)
• Algorithms for parametric nonconvex programming (Q1158344) (← links)
• LP-form inclusion functions for global optimization (Q1174536) (← links)
• Normal conical algorithm for concave minimization over polytopes (Q1177231) (← links)
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms (Q1177911) (← links)
• An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
• An algorithm for indefinite quadratic programming with convex constraints (Q1180839) (← 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)
• A new reformulation-linearization technique for bilinear programming problems (Q1201905) (← links)
• Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
• A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem (Q1278325) (← links)
• A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set (Q1321160) (← links)
• Average shadow prices in mathematical programming (Q1321203) (← links)
• Calculating a minimal sphere containing a polytope defined by a system of linear inequalities (Q1326513) (← links)
• A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• Lagrange duality and partitioning techniques in nonconvex global optimization (Q1372558) (← links)
• Outcome space partition of the weight set in multiobjective linear programming (Q1579630) (← links)