Results 51 to 60 of about 2,017,112 (308)
Randomized gradient-free methods in convex optimization [PDF]
, 2023 This review presents modern gradient-free methods to solve convex optimization problems. By gradient-free methods, we mean those that use only (noisy) realizations of the objective value.
Dvurechensky, Pavel +5 more
core +1 more source
Joint Transceiver Optimization for Multiuser Multi-Antenna Relay Systems With Energy Harvesting
IEEE Access, 2019 In this paper, a multiuser multi-antenna relay system with wireless power transfer is investigated, where the relay node harvests energy from the radio frequency signal sent from the source node and utilizes the harvested energy to forward the ...
Jinlong Wang +4 more
doaj +1 more source
First-Order Methods for Convex Optimization
EURO Journal on Computational Optimization, 2021 First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various
Pavel Dvurechensky +2 more
doaj +1 more source
Convex Discrete Optimization [PDF]
, 2008 We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial optimization problems and convex integer programming problems in variable dimension. We discuss some of the many applications
openaire +2 more sources
The Lupus Damage Index Revision Program: Results From the Item Generation and Reduction Phases
Arthritis Care &Research, EarlyView.Objective A data‐driven and expert/patient consensus‐based project to develop a revised Systemic Lupus International Collaborating Clinics (SLICC)/American College of Rheumatology (ACR) Damage Index (SDI) is under way supported by SLICC, ACR, and the Lupus Foundation of America. Our objective is to report the item generation and reduction phase results
Burak Kundakci +25 more
wiley +1 more source
Efficient Convex Optimization of Reentry Trajectory via the Chebyshev Pseudospectral Method
International Journal of Aerospace Engineering, 2019 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
Sensors, 2013 Deployment is a critical issue affecting the quality of service of camera networks. The deployment aims at adopting the least number of cameras to cover the whole scene, which may have obstacles to occlude the line of sight, with expected observation ...
Guangming Shi +3 more
doaj +1 more source
Contracting proximal methods for smooth convex optimization
, 2019 In this paper, we propose new accelerated methods for smooth Convex Optimization, called Contracting Proximal Methods. At every step of these methods, we need to minimize a contracted version of the objective function augmented by a regularization term ...
Doikov, Nikita, Nesterov, Yurii
core +1 more source
Observer‐Based Adaptive Event‐Triggered Tracking Control for Fuzzy TS Systems With Premise Mismatch
International Journal of Adaptive Control and Signal Processing, EarlyView.This paper presents an adaptive logistic event‐triggered observer‐based tracking controller for Takagi‐Sugeno fuzzy systems under constrained inputs and network delays. Leveraging a hybrid LMI and Secretary Bird Optimization approach, this strategy significantly minimizes communication overhead and computational burden while ensuring optimal reference ...
Oussama Djadane +3 more
wiley +1 more source
Dilated POCS: Minimax Convex Optimization
IEEE Access, 2023 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