Global optimization for special reverse convex programming

DOI10.1016/j.camwa.2007.04.046zbMath1145.90056OpenAlexW1994365609MaRDI QIDQ931747

Ying Lan, Yan-Jun Wang

Publication date: 26 June 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2007.04.046

zbMATH Keywords

global optimizationreverse convex programmingbranch and boundlinear relaxation programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items

Range division and contraction algorithm for a class of global optimization problems ⋮ A global optimization approach for solving generalized nonlinear multiplicative programming problem ⋮ The complexity results of the sparse optimization problems and reverse convex optimization problems ⋮ A new concave reformulation and its application in solving DC programming globally under uncertain environment ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints ⋮ A nonisolated optimal solution for special reverse convex programming problems

Cites Work

• Convex programs with an additional reverse convex constraint
• Linear programs with an additional reverse convex constraint
• Reverse convex programming
• A finite algorithm for globally optimizing a class of rank-two reverse convex programs
• Geometric programming with signomials
• Complementary Geometric Programming
• The Validity of a Family of Optimization Methods
• Iterative Solution of Nonlinear Optimal Control Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Global optimization for special reverse convex programming