Results 51 to 60 of about 330,664 (214)
Simultaneous Tensor Completion and Denoising by Noise Inequality Constrained Convex Optimization
Convex optimization, rather than a non-convex approach, still play important roles in many computer science applications because of its exactness and efficiency.
Tatsuya Yokota, Hidekata Hontani
doaj +1 more source
Research on Multibeam Pattern Synthesis of Time Modulated Array Based on Convex Optimization
An efficient multibeam pattern synthesis method for time modulated array (TMA) is proposed in this paper. The aim of this method is to generate a beam pattern on the specified sideband of TMA. The pattern synthesis problem is divided into two stages.
Jiawen Hu+4 more
doaj +1 more source
Convex Optimal Uncertainty Quantification [PDF]
Accepted for publication in SIAM Journal on ...
Han, Shuo+4 more
openaire +5 more sources
Doubly Constrained Waveform Optimization for Integrated Sensing and Communications
This paper investigates threshold-constrained joint waveform optimization for an integrated sensing and communication (ISAC) system. Unlike existing studies, we employ mutual information (MI) and sum rate (SR) as sensing and communication metrics ...
Zhitong Ni+3 more
doaj +1 more source
Learning Convex Optimization Models [PDF]
A convex optimization model predicts an output from an input by solving a convex optimization problem. The class of convex optimization models is large, and includes as special cases many well-known models like linear and logistic regression. We propose a heuristic for learning the parameters in a convex optimization model given a dataset of input ...
arxiv
Given a bounded real function f defined on a closed bounded real interval I, the problem is to find a quasi-convex function f′ so as to minimize the supremum of |f(s)-f′(s)| for all s in I, over the class of all quasi-convex functions f′ on I. This article obtains optimal solutions to the problem and derives their properties. This problem arises in the
openaire +2 more sources
Fuzzy convexity and multiobjective convex optimization problems
AbstractIn this paper, based on the more restrictive definition of fuzzy convexity due to Ammar and Metz [1], several useful composition rules are developed. The advantages in using the more restrictive definition of fuzzy convexity are that local optimality implies global optimality, and that any convex combination of such convex fuzzy sets is also a ...
Yu-Ru Syau+3 more
openaire +2 more sources
Efficient Convex Optimization of Reentry Trajectory via the Chebyshev Pseudospectral Method
A novel sequential convex (SCvx) optimization scheme via the Chebyshev pseudospectral method is proposed for efficiently solving the hypersonic reentry trajectory optimization problem which is highly constrained by heat flux, dynamic pressure, normal ...
Chun-Mei Yu, Dang-Jun Zhao, Ye Yang
doaj +1 more source
Optimal Resource Allocation for Two-User and Single-DF-Relay Network With Ambient Backscatter
In this paper, we investigate and analyze a two-user single decode-and-forward (DF) relay network with ambient backscatter communication capabilities, where the user nodes and the relay node are equipped with a wireless-powered device instead of embedded
Chuangming Zheng+2 more
doaj +1 more source
Sharp boundary regularity for some degenerate-singular Monge-Ampère Equations on k-convex domain [PDF]
We introduce the concept of k-strictly convexity to describe the accurate convexity of convex domains some directions of which boundary may be flat. Basing this accurate convexity, we construct sub-solutions the Dirichlet problem for some degenerate-singular Monge-Amp\`ere type equations and prove the sharp boundary estimates for convex viscosity ...
arxiv