Reverse convex programming

DOI10.1007/BF01442883zbMath0448.90044OpenAlexW1989711444MaRDI QIDQ1147072

Richard J. Hillestad, Stephen E. Jacobsen

Publication date: 1980

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01442883

zbMATH Keywords

optimality conditionsreverse convex programcutting plane algorithmpseudo-convex functionbasic solutionpseudo- concave function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Convexity of real functions in one variable, generalizations (26A51)

Related Items

Variations and extension of the convex-concave procedure, Convex programs with an additional constraint on the product of several convex functions, Extended reverse-convex programming: an approximate enumeration approach to global optimization, A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems, On the global minimization of a convex function under general nonconvex constraints, Intersection Disjunctions for Reverse Convex Sets, Reverse convex problems: an approach based on optimality conditions, A customized branch-and-bound approach for irregular shape nesting, Canonical DC programming problem: Outer approximation methods revisited, Convex MPC for exclusion constraints, Unboundedness in reverse convex and concave integer programming, Safe polyhedral tubes for locally convexified MPC, A branch-and-reduce approach to global optimization, Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets, Linear programs with an additional reverse convex constraint, Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints, Outer-product-free sets for polynomial optimization and oracle-based cuts, A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation, Duality and optimality conditions for reverse convex programs via a convex decomposition, Global optimality test for maximin solution of bilevel linear programming with ambiguous lower-level objective function, A finite cutting plane method for solving linear programs with an additional reverse convex constraint, Feasibility in reverse convex mixed-integer programming, On the use of cuts in reverse convex programs, DC programming: overview., Global optimization for special reverse convex programming, Mathematical programs with a two-dimensional reverse convex constraint, On optimization over the efficient set in linear multicriteria programming, DC decomposition of nonconvex polynomials with algebraic techniques, Duality theorems for quasiconvex programming with a reverse quasiconvex constraint, A generalized duality and applications, Successive search methods for solving a canonical DC programming problem, An algorithm for solving convex programs with an additional convex- concave constraint, Calculation of bounds on variables satisfying nonlinear inequality constraints, Feasible partition problem in reverse convex and convex mixed-integer programming, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, Unnamed Item, A nonisolated optimal solution for special reverse convex programming problems, On tackling reverse convex constraints for non-overlapping of unequal circles, A level set algorithm for a class of reverse convex programs, Convex minimization under Lipschitz constraints, Sequential convexification in reverse convex and disjunctive programming, Estimation of Individualized Decision Rules Based on an Optimized Covariate-Dependent Equivalent of Random Outcomes, The Discrete Moment Problem with Nonconvex Shape Constraints, Computational experience using an edge search algorithm for linear reverse convex programs, Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications, Convex programs with an additional reverse convex constraint, A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for optimizing network flow capacity under economies of scale
• Characterization of local solutions for a class of nonconvex programs
• The Cutting-Plane Method for Solving Convex Programs
• Complementary Geometric Programming
• Optimization Problems Subject to a Budget Constraint with Economies of Scale
• The Validity of a Family of Optimization Methods
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Iterative Solution of Nonlinear Optimal Control Problems
• Concave Programming Applied to a Special Class of 0-1 Integer Programs