Pages that link to "Item:Q3703662"

The following pages link to A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set (Q3703662):

Displaying 34 items.

• Successive smoothing algorithm for solving large-scale optimization models with fixed cost (Q492827) (← links)
• Unboundedness in reverse convex and concave integer programming (Q604803) (← 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)
• A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243) (← links)
• Note on solving linear complementarity problems as jointly constrained bilinear programs (Q809900) (← 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 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)
• 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)
• A note on the solution of bilinear programming problems by reduction to concave minimization (Q1102190) (← links)
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
• A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications (Q1112727) (← links)
• Conically bounded sets and optimization (Q1116404) (← links)
• Normal conical algorithm for concave minimization over polytopes (Q1177231) (← links)
• Efficient algorithms for solving rank two and rank three bilinear programming problems (Q1186269) (← 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)
• New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints (Q1310977) (← links)
• Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems (Q1321233) (← links)
• Primal-relaxed dual global optimization approach (Q1321372) (← 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)
• Convex minimization under Lipschitz constraints (Q1823144) (← links)
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems (Q1913605) (← links)
• Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208) (← links)
• A note on adapting methods for continuous global optimization to the discrete case (Q2276877) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
• D.c sets, d.c. functions and nonlinear equations (Q2367918) (← links)
• Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
• On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
• Finite method of minimizing a concave function under linear constraints and applications (Q3030588) (← links)
• Input Efficiency Measures: A Generalized, Encompassing Formulation (Q5144799) (← links)