Outer approximation by polyhedral convex sets

Recommendations

Approximation of convex sets by polytopes
scientific article; zbMATH DE number 665688
scientific article; zbMATH DE number 3354146
On the approximation of unbounded convex sets by polyhedra
Polyhedral approximations of strictly convex compacta
Polya-type best approximation of convex sets
scientific article; zbMATH DE number 4120902
scientific article; zbMATH DE number 2094570
Approximation of convex functions by projections of polyhedra
scientific article; zbMATH DE number 3995466

Cites work

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

Cited in

(31)

On outer approximation methods for solving concave minimization problems
Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
On solving a d.c. programming problem by a sequence of linear programs
A new simplicial cover technique in constrained global optimization
A global optimization approach for solving the convex multiplicative programming problem
Linear multiplicative programming
An outer approximation algorithm guaranteeing feasibility of solutions and approximate accuracy of optimality
Global minimization of a generalized convex multiplicative function
Constraint decomposition algorithms in global optimization
Utility function programs and optimization over the efficient set in multiple-objective decision making
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
DC programming: overview.
A combined cutting-stock and lot-sizing problem
An outer approximate subdifferential method for piecewise affine optimization
A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
Outer-product-free sets for polynomial optimization and oracle-based cuts
Separable concave minimization via partial outer approximation and branch and bound
A criterion for an approximation global optimal solution based on the filled functions
On solving general reverse convex programming problems by a sequence of linear programs and line searches
On the approximation of unbounded convex sets by polyhedra
A unifying polyhedral approximation framework for convex optimization
A relaxed projection method for finite-dimensional equilibrium problems
scientific article; zbMATH DE number 5283292 (Why is no real title available?)
On an outer approximation concept in global optimization
scientific article; zbMATH DE number 2182581 (Why is no real title available?)
scientific article; zbMATH DE number 4120902 (Why is no real title available?)
Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
A branch and bound-outer approximation algorithm for concave minimization over a convex set
On the convergence of a class of outer approximation algorithms for convex programs
Concave minimization via conical partitions and polyhedral outer approximation

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)