How to advance in Structural Convex Optimization
, 2008 In this paper we are trying to analyze the common features of the recent advances in Structural Convex Optimization: polynomial-time interior-point methods, smoothing technique, minimization in relative scale, and minimization of composite ...
Nesterov, Yurii
core
Trajectory Optimization for UAV-Aided IoT Secure Communication Against Multiple Eavesdroppers
Future InternetThis study concentrates on physical layer security (PLS) in UAV-aided Internet of Things (IoT) networks and proposes an innovative approach to enhance security by optimizing the trajectory of unmanned aerial vehicles (UAVs).
Lingfeng Shen +5 more
doaj +1 more source
A new outlier detection method based on convex optimization: application to diagnosis of Parkinson's disease. [PDF]
J Appl Stat, 2021 Taylan P +3 more
europepmc +1 more source
New duality results for evenly convex optimization problems. [PDF]
Optimization, 2021 Fajardo MD, Grad SM, Vidal J.
europepmc +1 more source
A New Characterization of Convex Games [PDF]
A cooperative game turns out to be convex if and only if all its marginal games are superadditive.characterization;convex games;marginal games;superadditive ...
Brânzei, R., Tijs, S.H., Dimitrov, D.A.
core
Implementable tensor methods in unconstrained convex optimization. [PDF]
Math Program, 2021 Nesterov Y.
europepmc +1 more source
Double smoothing technique for infinite-dimensional optimization problems with applications to optimal control [PDF]
In this paper, we propose an efficient technique for solving some infinite-dimensional problems over the sets of functions of time. In our problem, besides the convex point-wise constraints on state variables, we have convex coupling constraints with ...
GLINEUR, François +2 more
core
Reconstruction of Relative Phase of Self-Transmitting Devices by Using Multiprobe Solutions and Non-Convex Optimization. [PDF]
Sensors (Basel), 2021 Tena Sánchez R +4 more
europepmc +1 more source
A deep cut ellipsoid algorithm for convex programming [PDF]
This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its ...
Zhang, S. +2 more
core
Minty variational inequalities, increase-along-rays property and optimization [PDF]
Let E be a linear space, K E and f : K ? R. We put in terms of the lower Dini directional derivative a problem, referred to as GMV I(f ,K), which can be considered as a generalization of the Minty variational inequality of differential type (for short ...
Rocca Matteo +2 more
core