Results 1 to 10 of about 39,060 (206)
On Convex Relaxations in Nonconvex Optimization
Chemical Engineering Transactions, 2011 preview not available - see full-text PDF article.
T. Westerlund, A. Lundell, J. Westerlund
doaj +2 more sources
Second-Order Online Nonconvex Optimization [PDF]
IEEE Transactions on Automatic Control, 2021 We present the online Newton's method, a single-step second-order method for online nonconvex optimization. We analyze its performance and obtain a dynamic regret bound that is linear in the cumulative variation between round optima. We show that if the variation between round optima is limited, the method leads to a constant regret bound.
Antoine Lesage-Landry +2 more
openaire +3 more sources
On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks [PDF]
Quantum, 2023 Classical algorithms are often not effective for solving nonconvex optimization problems where local minima are separated by high barriers. In this paper, we explore possible quantum speedups for nonconvex optimization by leveraging the $global$ effect ...
Yizhou Liu, Weijie J. Su, Tongyang Li
doaj +1 more source
Journal of Function Spaces, 2022 In modern world, most of the optimization problems are nonconvex which are neither convex nor concave. The objective of this research is to study a class of nonconvex functions, namely, strongly nonconvex functions.
Wenbo Xu +4 more
doaj +1 more source
Nonconvex nonsmooth optimization via convex–nonconvex majorization–minimization [PDF]
Numerische Mathematik, 2016 The authors present a majorization-minimization approach based on a novel convex-nonconvex upper bounding strategy for the solution of certain classes of nonconvex nonsmooth optimization problems. They propose an efficient algorithm for minimizing the (convex) surrogate function based on the alternating direction method of multipliers.
LANZA, ALESSANDRO +3 more
openaire +3 more sources
Existence of Solutions for Nonconvex and Nonsmooth Vector Optimization Problems
Journal of Inequalities and Applications, 2008 We consider the weakly efficient solution for a class of nonconvex and nonsmooth vector optimization problems in Banach spaces. We show the equivalence between the nonconvex and nonsmooth vector optimization problem and the vector variational-like ...
Nan-Jing Huang +2 more
doaj +2 more sources
Unified Algorithm Framework for Nonconvex Stochastic Optimization in Deep Neural Networks
IEEE Access, 2021 This paper presents a unified algorithmic framework for nonconvex stochastic optimization, which is needed to train deep neural networks. The unified algorithm includes the existing adaptive-learning-rate optimization algorithms, such as Adaptive Moment ...
Yini Zhu, Hideaki Iiduka
doaj +1 more source
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2020 This is a companion paper to "Ghost penalties in nonconvex constrained optimization: Diminishing stepsizes and iteration complexity" (to appear in Mathematics of Operations Research).
Francisco Facchinei +3 more
doaj +1 more source
SWIPT techniques for multiuser MIMO broadcast systems [PDF]
, 2016 In this paper, we present an approach to solve the nonconvex optimization problem that arises when designing the transmit covariance matrices in multiuser multiple-input multiple-output (MIMO) broadcast networks implementing simultaneous wireless ...
Goldsmith, Andrea +3 more
core +1 more source
Two-channel linear phase FIR QMF bank minimax design via global nonconvex optimization programming [PDF]
, 2010 In this correspondence, a two-channel linear phase finite impulse response (FIR) quadrature mirror filter (QMF) bank minimax design problem is formulated as a nonconvex optimization problem so that a weighted sum of the maximum amplitude distortion of ...
Benmesbah, Lamia +5 more
core +2 more sources