Pages that link to "Item:Q4085500"

The following pages link to Global Maximization of a Convex Function with Linear Inequality Constraints (Q4085500):

Displaying 34 items.

• Minimization of a quasi-concave function over an efficient set (Q689154) (← links)
• Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) (← links)
• On the global minimization of concave functions (Q800693) (← links)
• On the nonlinear multilevel programming problems (Q998684) (← links)
• An exact penalty on bilevel programs with linear vector optimization lower level (Q1011256) (← links)
• Convergence of a subgradient method for computing the bound norm of matrices (Q1057619) (← links)
• An algorithm for optimizing over the weakly-efficient set (Q1077330) (← 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)
• Using convex envelopes to solve the interactive fixed-charge linear programming problem (Q1093525) (← links)
• On the structure and properties of a linear multilevel programming problem (Q1095807) (← links)
• On a class of functions attaining their maximum at the vertices of a polyhedron (Q1115347) (← links)
• Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints (Q1148807) (← links)
• Normal conical algorithm for concave minimization over polytopes (Q1177231) (← links)
• Linear multiplicative programming (Q1207311) (← links)
• Maximization of linearly constrained posynomials (Q1245683) (← links)
• Calculating a minimal sphere containing a polytope defined by a system of linear inequalities (Q1326513) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• A heuristic for the continuous capacity and flow assignment (Q1869661) (← links)
• A convergent conical algorithm with \(\omega \)-bisection for concave minimization (Q2018479) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
• A weighting method for 0-1 indefinite quadratic bilevel programming (Q2359528) (← links)
• Nonlinear programming: Global use of the Lagrangian (Q2535944) (← links)
• A decomposition approach for global optimum search in QP, NLP and MINLP problems (Q2638940) (← links)
• On Non Overlapping Segmentation of the Response Surfaces for Solving Constrained Programming Problems Through Super Convergent Line Series (Q2815362) (← links)
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts (Q3877412) (← links)
• Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual (Q3892089) (← links)
• Maximization of A convex quadratic function under linear constraints (Q4127644) (← links)
• A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron (Q4136974) (← links)
• An Algorithm for Maximizing a Convex Function Based on Its Minimum (Q5060795) (← links)
• Convex Maximization via Adjustable Robust Optimization (Q5106408) (← links)
• Subdeterminants and Concave Integer Quadratic Programming (Q5206942) (← links)
• Optimization over the efficient set (Q5896268) (← links)
• On the convergence of cone splitting algorithms with \(\omega\)-subdivisions (Q5947265) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)