Results 61 to 70 of about 330,664 (214)
A Survey of Hidden Convex Optimization [PDF]
Journal of the Operations Research Society of China, 2020 Motivated by the fact that not all nonconvex optimization problems are difficult to solve, we survey in this paper three widely-used ways to reveal the hidden convex structure for different classes of nonconvex optimization problems. Finally, ten open problems are raised.
openaire +3 more sources
Robust Secure Resource Allocation for RIS-Aided SWIPT Communication Systems
Sensors, 2022 Aiming at the influence of channel uncertainty, user information leakage and harvested energy improvement, this paper proposes a robust resource allocation algorithm for reconfigurable intelligent reflector (RIS) multiple-input single-output systems ...
Bencheng Yu, Zihui Ren, Shoufeng Tang
doaj +1 more source
Approximations of unbounded convex projections and unbounded convex sets [PDF]
arXiv, 2023 We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex sets by polyhedrons. The existing literature on convex projections provides methods for bounded convex sets only,
arxiv
Strong Fenchel Duality for Evenly Convex Optimization Problems
Journal of Applied Science and Engineering, 2023 Among a variety of approaches introduced in the literature to establish duality theory, Fenchel duality was of great importance in convex analysis and optimization. In this paper we establish some conditions to obtain classical strong Fenchel duality for
Saba Naser Majeed
doaj +1 more source
Directed Discrete Midpoint Convexity [PDF]
arXiv, 2020 For continuous functions, midpoint convexity characterizes convex functions. By considering discrete versions of midpoint convexity, several types of discrete convexities of functions, including integral convexity, L$^\natural$-convexity and global/local discrete midpoint convexity, have been studied.
arxiv
On Convex Clustering Solutions [PDF]
arXiv, 2021 Convex clustering is an attractive clustering algorithm with favorable properties such as efficiency and optimality owing to its convex formulation. It is thought to generalize both k-means clustering and agglomerative clustering. However, it is not known whether convex clustering preserves desirable properties of these algorithms. A common expectation
arxiv
SDP Duals without Duality Gaps for a Class of Convex Minimax Programs [PDF]
J Optim Theory Appl 2013, 2013 In this paper we introduce a new dual program, which is representable as a semi-definite linear programming problem, for a primal convex minimax programming model problem and show that there is no duality gap between the primal and the dual whenever the functions involved are SOS-convex polynomials.
arxiv +1 more source
Distributed constrained optimization via continuous-time mirror design
Advances in Difference Equations, 2018 Recently, distributed convex optimization using a multiagent system has received much attention by many researchers. This problem is frequently approached by combing the consensus algorithms in the multiagent literature and the gradient algorithms in the
Rui Sheng, Wei Ni
doaj +1 more source
ON OPTIMUM DESIGN OF FRAME STRUCTURES
Acta Polytechnica CTU Proceedings, 2020 Optimization of frame structures is formulated as a non-convex optimization problem, which is currently solved to local optimality. In this contribution, we investigate four optimization approaches: (i) general non-linear optimization, (ii) optimality ...
Marek Tyburec +3 more
doaj +1 more source
Digital Chemical Engineering, 2023 With increasing digitalization and vertical integration of chemical process systems, nonconvex optimization problems often emerge in chemical engineering applications, yet require specialized optimization techniques.
Yingwei Yuan, Kamil A. Khan
doaj