Pages that link to "Item:Q3927058"

The following pages link to Convergent Algorithms for Minimizing a Concave Function (Q3927058):

Displaying 50 items.

• A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm (Q286595) (← links)
• On the relation between concavity cuts and the surrogate dual for convex maximization problems (Q427376) (← links)
• Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
• Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (Q613601) (← links)
• A generalized duality and applications (Q686992) (← 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)
• A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243) (← links)
• On the global minimization of concave functions (Q800693) (← links)
• Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications (Q811400) (← links)
• Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
• A successive linear approximation algorithm for the global minimization of a concave quadratic program (Q827382) (← links)
• On the nonlinear multilevel programming problems (Q998684) (← links)
• Convergence of a subgradient method for computing the bound norm of matrices (Q1057619) (← links)
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization (Q1067978) (← links)
• A branch and bound algorithm for extreme point mathematical programming problems (Q1078072) (← 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)
• On the structure and properties of a linear multilevel programming problem (Q1095807) (← 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)
• A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications (Q1112727) (← links)
• On a class of functions attaining their maximum at the vertices of a polyhedron (Q1115347) (← links)
• Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems (Q1122325) (← 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)
• Efficient algorithms for solving rank two and rank three bilinear programming problems (Q1186269) (← links)
• Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
• Linear multiplicative programming (Q1207311) (← links)
• A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set (Q1321160) (← links)
• Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems (Q1321233) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• Constraint decomposition algorithms in global optimization (Q1342897) (← links)
• A branch bound method for subset sum problem (Q1343509) (← links)
• Global optimization method for solving mathematical programs with linear complementarity constraints (Q1777600) (← links)
• Convex minimization under Lipschitz constraints (Q1823144) (← links)
• Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595) (← links)
• Decomposition approach for the global minimization of biconcave functions over polytopes (Q1918288) (← links)
• DC programming: overview. (Q1969457) (← links)
• A convergent conical algorithm with \(\omega \)-bisection for concave minimization (Q2018479) (← links)
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
• Variations and extension of the convex-concave procedure (Q2358020) (← links)
• A weighting method for 0-1 indefinite quadratic bilevel programming (Q2359528) (← links)
• D.c sets, d.c. functions and nonlinear equations (Q2367918) (← links)
• On the indefinite quadratic bilevel programming problem. (Q2477129) (← links)
• On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
• A decomposition approach for global optimum search in QP, NLP and MINLP problems (Q2638940) (← links)
• Optimization over equilibrium sets^∗ (Q2710390) (← links)