Suchergebnisse - "Reverse convex programming"
-
1
Extended reverse-convex programming: an approximate enumeration approach to global optimization
ISSN: 0925-5001, 1573-2916Veröffentlicht: New York Springer US 01.06.2016Veröffentlicht in Journal of global optimization (01.06.2016)“… Unlike the traditional strategy of partitioning the decision-variable space employed in many branch-and-bound methods, the proposed approach approximates the NLP problem by a reverse-convex programming (RCP …”
Volltext
Journal Article -
2
Global optimization for special reverse convex programming
ISSN: 0898-1221, 1873-7668Veröffentlicht: Elsevier Ltd 01.03.2008Veröffentlicht in Computers & mathematics with applications (1987) (01.03.2008)“… A global optimization algorithm is proposed in order to locate the global minimum of the special reverse convex programming which is both nonconvex and nonlinear …”
Volltext
Journal Article -
3
A nonisolated optimal solution for special reverse convex programming problems
ISSN: 0377-0427, 1879-1778Veröffentlicht: Kidlington Elsevier B.V 01.02.2009Veröffentlicht in Journal of computational and applied mathematics (01.02.2009)“… In this paper, an efficient algorithm is proposed for globally solving special reverse convex programming problems with more than one reverse convex constraints …”
Volltext
Journal Article -
4
Reverse Convex Programming Approach in the Space of Extreme Criteria for Optimization over Efficient Sets
ISSN: 0022-3239, 1573-2878Veröffentlicht: Boston Springer US 01.11.2010Veröffentlicht in Journal of optimization theory and applications (01.11.2010)“… The problem of minimizing a convex function over the difference of two convex sets is called ‘reverse convex program’. This is a typical problem in global …”
Volltext
Journal Article -
5
A note on duality in reverse convex optimization
ISSN: 0233-1934, 1029-4945Veröffentlicht: Philadelphia Taylor & Francis 01.12.2024Veröffentlicht in Optimization (01.12.2024)“… In this note we explore duality in reverse convex optimization with reverse convex inequality constraints. While we are examining the special case of a finite …”
Volltext
Journal Article -
6
Global Optimization of Relay Placement for Seafloor Optical Wireless Networks
ISSN: 1536-1276, 1558-2248Veröffentlicht: New York IEEE 01.03.2021Veröffentlicht in IEEE transactions on wireless communications (01.03.2021)“… Optical wireless communication is a promising technology for underwater broadband access networks, which are particularly important for high-resolution …”
Volltext
Journal Article -
7
Optimal Relay Placement in Magnetic Induction-Based Internet of Underwater Things
ISSN: 1530-437X, 1558-1748Veröffentlicht: New York IEEE 01.01.2021Veröffentlicht in IEEE sensors journal (01.01.2021)“… First, we formulate the relay placement problem as a non-convex optimization problem. Then, we propose a global optimization technique based on Reverse Convex Programming (RCP …”
Volltext
Journal Article -
8
Necessary Optimality Conditions for Vector Reverse Convex Minimization Problems via a Conjugate Duality
ISSN: 2305-221X, 2305-2228Veröffentlicht: Singapore Springer Nature Singapore 01.03.2024Veröffentlicht in Vietnam journal of mathematics (01.03.2024)“… The obtained results are new in the literature of vector reverse convex programming. Moreover, some of them extend with improvement some similar results given in the literature, from the scalar case to the vectorial one …”
Volltext
Journal Article -
9
A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation
ISSN: 1862-4472, 1862-4480Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2023Veröffentlicht in Optimization letters (01.03.2023)“… We study a chance-constrained optimization problem where the random variable appearing in the chance constraint follows a normal distribution whose mean and …”
Volltext
Journal Article -
10
Inner Approximation Method for a Reverse Convex Programming Problem
ISSN: 0022-3239, 1573-2878Veröffentlicht: New York, NY Springer 01.11.2000Veröffentlicht in Journal of optimization theory and applications (01.11.2000)“… In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set, which is defined by the complement of the interior of a compact convex set X …”
Volltext
Journal Article -
11
An inner approximation method incorporating with a penalty function method for a reverse convex programming problem
ISSN: 0377-0427, 1879-1778Veröffentlicht: Amsterdam Elsevier B.V 01.09.2002Veröffentlicht in Journal of computational and applied mathematics (01.09.2002)“… In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set which is defined by the complement of the interior of a compact convex set X …”
Volltext
Journal Article Tagungsbericht -
12
An inner approximation method incorporating with a penalty function method for a reverse convex programming problem
ISSN: 0377-0427Veröffentlicht: Elsevier BV 01.09.2002Veröffentlicht in Journal of Computational and Applied Mathematics (01.09.2002)Volltext
Journal Article -
13
An inner approximation method for a reverse convex programming problem
ISBN: 9780780357310, 0780357310ISSN: 1062-922XVeröffentlicht: IEEE 20.01.2003Veröffentlicht in IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028) (20.01.2003)“… In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set which is defined by the complement of the interior of a compact convex set X …”
Volltext
Tagungsbericht -
14
Some procedures for solving special max-min fractional rank-two reverse-convex programming problems
ISSN: 2457-6794, 2501-059XVeröffentlicht: Publishing House of the Romanian Academy 01.08.2004Veröffentlicht in Journal of numerical analysis and approximation theory (01.08.2004)“… We show that a special bilinear fractional max-min reverse-convex program can be solved by a linear reverse-convex programming problem …”
Volltext
Journal Article -
15
Some procedures for solving special max-min fractional rank-two reverse-convex programming problems
ISSN: 2457-6794, 2501-059XVeröffentlicht: Publishing House of the Romanian Academy 01.08.2004Veröffentlicht in Journal of numerical analysis and approximation theory (01.08.2004)“… We show that a special bilinear fractional max-min reverse-convex program can be solved by a linear reverse-convex programming problem …”
Volltext
Journal Article -
16
A reverse convex programming for beamforming in cognitive multicast transmission
ISBN: 9781424470556, 1424470552Veröffentlicht: IEEE 01.08.2010Veröffentlicht in 2010 Third International Conference on Communications and Electronics (01.08.2010)“… The cognitive beamforming problems are naturally formulated as indefinite quadratic (nonconvex) optimization programs. The typical methods for solving such …”
Volltext
Tagungsbericht -
17
Extended reverse-convex programming: an approximate enumeration approach to global optimization
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 25.04.2015Veröffentlicht in arXiv.org (25.04.2015)“… Unlike the traditional strategy of partitioning the decision-variable space employed in many branch-and-bound methods, the proposed approach approximates the NLP problem by a reverse-convex programming (RCP …”
Volltext
Paper -
18
Convexification and Concavification for a General Class of Global Optimization Problems
ISSN: 0925-5001, 1573-2916Veröffentlicht: Dordrecht Springer Nature B.V 01.01.2005Veröffentlicht in Journal of global optimization (01.01.2005)“… It is shown that these minimization problems can be transformed into equivalent concave minimization problem or reverse convex programming problem or canonical DC programming problem by using …”
Volltext
Journal Article -
19
A Cutting Plane Algorithm for Linear Reverse Convex Programs
ISSN: 0254-5330, 1572-9338Veröffentlicht: New York Springer Nature B.V 01.07.2001Veröffentlicht in Annals of operations research (01.07.2001)“… In this paper, global optimization of linear programs with an additional reverse convex constraint is considered. This type of problem arises in many …”
Volltext
Journal Article -
20
Duality and optimality conditions for reverse convex programs via a convex decomposition
ISSN: 0009-725X, 1973-4409Veröffentlicht: Cham Springer International Publishing 01.12.2023Veröffentlicht in Rendiconti del Circolo matematico di Palermo (01.12.2023)“… In this paper via the so-called Fenchel–Lagrange duality, we provide necessary local optimality conditions for a reverse convex programming problem ( P …”
Volltext
Journal Article

