Results 11 to 20 of about 335,930 (310)
Convex Matroid Optimization [PDF]
SIAM Journal on Discrete Mathematics, 2003 We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a suitable parameter is restricted.
Onn, Shmuel
openaire +5 more sources
Convex Combinatorial Optimization [PDF]
Discrete & Computational Geometry, 2004 We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and discuss several applications.
Onn, Shmuel, Rothblum, Uriel G.
openaire +8 more sources
Journal of Inequalities and Applications, 2019 In this paper, we first introduce a new algorithm which involves projecting each iteration to solve a split feasibility problem with paramonotone equilibria and using unconstrained convex optimization.
Q. L. Dong +4 more
doaj +2 more sources
Quasi-Herglotz functions and convex optimization [PDF]
Royal Society Open Science, 2020 We introduce the set of quasi-Herglotz functions and demonstrate that it has properties useful in the modelling of non-passive systems. The linear space of quasi-Herglotz functions constitutes a natural extension of the convex cone of Herglotz functions.
Y. Ivanenko +5 more
doaj +2 more sources
, 2021 This textbook is based on lectures given by the authors at MIPT (Moscow), HSE (Moscow), FEFU (Vladivostok), V.I. Vernadsky KFU (Simferopol), ASU (Republic of Adygea), and the University of Grenoble-Alpes (Grenoble, France). First of all, the authors focused on the program of a two-semester course of lectures on convex optimization, which is given to ...
Johannes O. Royset, Roger J-B Wets
+7 more sources
Quasi Semi and Pseudo Semi (p,E)-Convexity in Non-Linear Optimization Programming
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2023 The class of quasi semi -convex functions and pseudo semi -convex functions are presented in this paper by combining the class of -convex functions with the class of quasi semi -convex functions and pseudo semi -convex functions, respectively.
Revan I. Hazim, Saba N. Majeed
doaj +1 more source
Optimization Method for Wide Beam Sonar Transmit Beamforming
Sensors, 2022 Imaging and mapping sonars such as forward-looking sonars (FLS) and side-scan sonars (SSS) are sensors frequently used onboard autonomous underwater vehicles.
Louise Rixon Fuchs +2 more
doaj +1 more source
Resource Configuration for Throughput Maximization in UAV-WPCN With Intelligent Reflecting Surface
IEEE Access, 2023 UAV-based wireless powered communication network is a promising method of power supply for battery-free IoT devices, but the limited wireless transmission capability of the UAV constrains the coverage area and transmission throughput.
Liang Xue +5 more
doaj +1 more source
Quantum algorithms and lower bounds for convex optimization [PDF]
Quantum, 2020 While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization.
Shouvanik Chakrabarti +3 more
doaj +1 more source
Exploiting Block Structures of KKT Matrices for Efficient Solution of Convex Optimization Problems
IEEE Access, 2021 Convex optimization solvers are widely used in the embedded systems that require sophisticated optimization algorithms including model predictive control (MPC).
Zafar Iqbal +4 more
doaj +1 more source