Results 1 to 10 of about 3,146 (222)
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 +5 more sources
A Customized ADMM Approach for Large-Scale Nonconvex Semidefinite Programming [PDF]
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 +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
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
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
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
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
A Global Optimization Algorithm for Generalized Quadratic Programming
We present a global optimization algorithm for solving generalized quadratic programming (GQP), that is, nonconvex quadratic programming with nonconvex quadratic constraints.
Hongwei Jiao, Yongqiang Chen
doaj +1 more source
In this article, a highly nonlinear trajectory optimization problem for reentry vehicles is rapidly solved by the proposed modified sequential convex programming (MSCP) method.
Pei Pei, Shipeng Fan, Wei Wang, Defu Lin
doaj +1 more source

