Results 21 to 30 of about 39,060 (206)
A Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization
Abstract and Applied Analysis, 2013 A class of constrained nonsmooth nonconvex optimization problems, that is, piecewise C2 objectives with smooth inequality constraints are discussed in this paper.
Yuan Lu, Wei Wang, Li-Ping Pang, Dan Li
doaj +1 more source
A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
Results in Applied Mathematics, 2019 For the problem of sparse recovery, it is widely accepted that nonconvex minimizations are better than ℓ1 penalty in enhancing the sparsity of solution.
Hoang Tran, Clayton Webster
doaj +1 more source
EURASIP Journal on Wireless Communications and Networking, 2020 The green communication for 5th generation Internet of Things base on the energy collecting and security issues is studied in this paper. The transceiver and power splitting factor are optimized aiming at minimizing the transmitting power at the source ...
Meng Zhang +3 more
doaj +1 more source
Hybrid Global Search Algorithm with Genetic Blocks for Solving Hexamatrix Games
Известия Иркутского государственного университета: Серия "Математика", 2022 This work addresses the development of a hybrid approach to solving threeperson polymatrix games (hexamatrix games). On the one hand, this approach is based on the reduction of the game to a nonconvex optimization problem and the Global Search Theory ...
A. V. Orlov
doaj +1 more source
Distributed stochastic nonsmooth nonconvex optimization
Operations Research Letters, 2022 Distributed consensus optimization has received considerable attention in recent years; several distributed consensus-based algorithms have been proposed for (nonsmooth) convex and (smooth) nonconvex objective functions. However, the behavior of these distributed algorithms on {\it nonconvex, nonsmooth and stochastic} objective functions is not ...
openaire +2 more sources
A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem
Abstract and Applied Analysis, 2016 We propose a new method for the specific nonlinear and nonconvex global optimization problem by using a linear relaxation technique. To simplify the specific nonlinear and nonconvex optimization problem, we transform the problem to the lower linear ...
Mio Horai +2 more
doaj +1 more source
Mathematics, 2023 A high-precision online trajectory optimization method combining convex optimization and Radau pseudospectral method is presented for the large attitude flip vertical landing problem of a starship-like vehicle. During the landing process, the aerodynamic
Hongbo Chen +3 more
doaj +1 more source
Nonconvex optimization of desirability functions
Quality Engineering, 2017 ABSTRACTDesirability functions (DFs) are commonly used in optimization of design parameters with multiple quality characteristic to obtain a good compromise among predicted response models obtained from experimental designs. Besides discussing multi-objective approaches for optimization of DFs, we present a brief review of literature about most ...
Akteke-Ozturk, Basak +2 more
openaire +2 more sources
IEEE Access, 2018 In the past decade, sparse and low-rank recovery has drawn much attention in many areas such as signal/image processing, statistics, bioinformatics, and machine learning.
Fei Wen +3 more
doaj +1 more source
Nonconvex Sparse Representation With Slowly Vanishing Gradient Regularizers
IEEE Access, 2020 Sparse representation has been widely used over the past decade in computer vision and signal processing to model a wide range of natural phenomena.
Eunwoo Kim, Minsik Lee, Songhwai Oh
doaj +1 more source