Outer approximation by polyhedral convex sets

Cites Work

Convex Analysis
The Cutting-Plane Method for Solving Convex Programs
Newton's method for convex programming and Tschebyscheff approximation
The Supporting Hyperplane Method for Unimodal Programming
On the convergence of a class of outer approximation algorithms for convex programs
A Successive Underestimation Method for Concave Minimization Problems
Outer approximation algorithm for nondifferentiable optimization problems
A method for globally minimizing concave functions over convex sets
An Outer Approximation Algorithm for Solving General Convex Programs
Cutting-Plane Methods without Nested Constraint Sets
Approximate cutting planes in nonlinear programming
Applications of a general convergence theory for outer approximation algorithms

Cited In (25)

Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
DC programming: overview.
A global optimization approach for solving the convex multiplicative programming problem
A relaxed projection method for finite-dimensional equilibrium problems
Utility function programs and optimization over the efficient set in multiple-objective decision making
On solving a d.c. programming problem by a sequence of linear programs
Title not available (Why is that?)
On the approximation of unbounded convex sets by polyhedra
A combined cutting-stock and lot-sizing problem
Linear multiplicative programming
A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
An algorithm for maximizing a convex function over a simple set
Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
Concave minimization via conical partitions and polyhedral outer approximation
A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
Global minimization of a generalized convex multiplicative function
Title not available (Why is that?)
An outer approximate subdifferential method for piecewise affine optimization
A new simplicial cover technique in constrained global optimization
On an outer approximation concept in global optimization
Constraint decomposition algorithms in global optimization
A criterion for an approximation global optimal solution based on the filled functions
A branch and bound-outer approximation algorithm for concave minimization over a convex set
On solving general reverse convex programming problems by a sequence of linear programs and line searches
Separable concave minimization via partial outer approximation and branch and bound

   Recommendations

This page was built for publication: Outer approximation by polyhedral convex sets

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