Results 51 to 60 of about 29,427 (150)
Distributed constrained optimization via continuous-time mirror design
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
Dilated POCS: Minimax Convex Optimization
Alternating projection onto convex sets (POCS) provides an iterative procedure to find a signal that satisfies two or more convex constraints when the sets intersect.
Albert R. Yu +6 more
doaj +1 more source
ON OPTIMUM DESIGN OF FRAME STRUCTURES
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
Joint User Association and Beamforming Design for ISAC Networks With Large Language Models
Integrated sensing and communication (ISAC) has been envisioned to play a more important role in future wireless networks. However, the design of ISAC networks is challenging, especially when there are multiple communication and sensing (C&S ...
Haoyun Li +5 more
doaj +1 more source
Convex Optimization on Banach Spaces [PDF]
Greedy algorithms which use only function evaluations are applied to convex optimization in a general Banach space $X$. Along with algorithms that use exact evaluations, algorithms with approximate evaluations are treated. A priori upper bounds for the convergence rate of the proposed algorithms are given.
DeVore, R. A., Temlyakov, V. N.
openaire +2 more sources
Multimodularity, Convexity, and Optimization Properties [PDF]
In this paper we investigate the properties of multimodular functions. In doing so we give elementary proofs for properties already established by Hajek and we generalize some of his results. In particular, we extend the relation between convexity and multimodularity to some convex subsets of ℤm. We also obtain general optimization results for average
Altman, Eitan +2 more
openaire +3 more sources
This paper introduces constructing convex-relaxed programs for nonconvex optimization problems. Branch-and-bound algorithms are convex-relaxation-based techniques.
Keller André A.
doaj +1 more source
This paper proposes a convex quadratic optimization commutation method to raise the equalization degree of power loss distribution of coil array for magnetic levitation planar motors.
Shengguo Zhang +2 more
doaj +1 more source
Optimized Temporal Interference Stimulation Based on Convex Optimization: A Computational Study
Temporal interference (TI) stimulation is a non-invasive method targeting deep brain regions by applying two pairs of high-frequency currents with a slight frequency difference to the scalp.
Chao Geng +5 more
doaj +1 more source
RSS-TOA based localization algorithm in non-line-of-sight environment
The existence of non-line-of-sight (NLOS) error can degrade the positioning performance in wireless sensor network localization system,especially in indoor localization.To overcome the localization error caused by NLOS propagation,a localization ...
Zhigang LU +4 more
doaj +2 more sources

