Global Maximization of a Convex Function with Linear Inequality Constraints

Cited in

(34)

An exact penalty on bilevel programs with linear vector optimization lower level
Convergence of a subgradient method for computing the bound norm of matrices
An algorithm for optimizing over the weakly-efficient set
Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
Using convex envelopes to solve the interactive fixed-charge linear programming problem
On the structure and properties of a linear multilevel programming problem
On a class of functions attaining their maximum at the vertices of a polyhedron
Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints
Normal conical algorithm for concave minimization over polytopes
Linear multiplicative programming
Maximization of linearly constrained posynomials
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
A heuristic for the continuous capacity and flow assignment
A convergent conical algorithm with -bisection for concave minimization
Separable concave minimization via partial outer approximation and branch and bound
A weighting method for 0-1 indefinite quadratic bilevel programming
Nonlinear programming: Global use of the Lagrangian
A decomposition approach for global optimum search in QP, NLP and MINLP problems
On Non Overlapping Segmentation of the Response Surfaces for Solving Constrained Programming Problems Through Super Convergent Line Series
A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual
Maximization of A convex quadratic function under linear constraints
A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
An Algorithm for Maximizing a Convex Function Based on Its Minimum
Convex Maximization via Adjustable Robust Optimization
Subdeterminants and concave integer quadratic programming
Optimization over the efficient set
On the convergence of cone splitting algorithms with \(\omega\)-subdivisions
A general purpose exact solution method for mixed integer concave minimization problems
Minimization of a quasi-concave function over an efficient set
Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
On the global minimization of concave functions
On the nonlinear multilevel programming problems

This page was built for publication: Global Maximization of a Convex Function with Linear Inequality Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4085500)