Results 1 to 10 of about 24,658 (179)
Linear decomposition approach for a class of nonconvex programming problems [PDF]
This paper presents a linear decomposition approach for a class of nonconvex programming problems by dividing the input space into polynomially many grids.
Peiping Shen, Chunfeng Wang
doaj +2 more sources
Nondifferentiable generalized minimax fractional programming under (Ф,ρ)-invexity [PDF]
In this paper, a class of nonconvex nondifferentiable generalized minimax fractional programming problems is considered. Sufficient optimality conditions for the considered nondifferentiable generalized minimax fractional programming problem are ...
Upadhyay B.B. +3 more
doaj +1 more source
A Customized ADMM Approach for Large-Scale Nonconvex Semidefinite Programming
We investigate a class of challenging general semidefinite programming problems with extra nonconvex constraints such as matrix rank constraints. This problem has extensive applications, including combinatorial graph problems, such as MAX-CUT and ...
Chuangchuang Sun
doaj +1 more source
The branch and bound (BB) algorithm is widely used to obtain the global solution of mixed-integer linear programming (MILP) problems. On the other hand, when the traditional BB structure is directly used to solve nonconvex mixed-integer nonlinear ...
Reinaldo T. Zoppei +4 more
doaj +1 more source
In low earth orbit (LEO) satellite communication systems, the limited energy supply capacity and the difficulty in obtaining channel state information (CSI) are the practical challenges.
Yang Liu +3 more
doaj +1 more source
Fast Quantum State Reconstruction via Accelerated Non-Convex Programming
We propose a new quantum state reconstruction method that combines ideas from compressed sensing, non-convex optimization, and acceleration methods. The algorithm, called Momentum-Inspired Factored Gradient Descent (MiFGD), extends the applicability of ...
Junhyung Lyle Kim +4 more
doaj +1 more source
Quadratic Program on a Structured Nonconvex Set [PDF]
In this paper, we focus on a special nonconvex quadratic program whose feasible set is a structured nonconvex set. To find an effective method to solve this nonconvex program, we construct a bilevel program, where the low-level program is a convex program while the upper-level program is a small-scale nonconvex program. Utilizing some properties of the
Yi Xu, Lili Han
openaire +2 more sources
On the Energy Efficiency Maximization of NOMA-Aided Downlink Networks With Dynamic User Pairing
This study investigates a combined system comprising non-orthogonal multiple access (NOMA) and beamforming in a downlink network. To fully exploit the advantages of NOMA, user (UE) pairing and beamforming design are jointly optimized via a generalized ...
Kha-Hung Nguyen +4 more
doaj +1 more source
SWIPT techniques for multiuser MIMO broadcast systems [PDF]
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
Optimizing operations of large water supply networks: a case study [PDF]
In this paper we propose a mathematical programming model for a large drinking water supply network and discuss some possible extensions. The proposed optimization model is of a real water distribution network, the largest water supply network in ...
Aghezzaf, El-Houssaine +2 more
core +5 more sources

