Results 11 to 20 of about 3,006 (163)
An SQP Algorithm for Structural Topology Optimization Based on Majorization–Minimization Method
Applied Sciences, 2022 When applying the sequential quadratic programming (SQP) algorithm to topology optimization, using the quasi-Newton methods or calculating the Hessian matrix directly will result in a considerable amount of calculation, making it computationally ...
Weilong Liao, Qiliang Zhang, Huanli Meng
doaj +1 more source
A Multi-Step Inertial Proximal Peaceman-Rachford Splitting Method for Separable Convex Programming
IEEE Access, 2023 In this paper, we propose a multi-step inertial proximal Peaceman-Rachford splitting method (abbreviated as MIP-PRSM) for solving the two-block separable convex optimization problems with linear constraints, which is a unified framework for such Peaceman-
Hongyan Li, Dongmei Yu, Leifu Gao
doaj +1 more source
IEEE Access, 2022 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
The Application of Practical Clothing Design Method in the Teaching of Clothing Specialty
Advances in Multimedia, 2022 To improve the teaching practice effect of clothing major, this study applies the practical clothing design method to the teaching of clothing major to analyze the digital clothing design and establishes a convex quadratic conic programming model for a ...
Miao Li, Rong Fu
doaj +1 more source
Methods for convex and general quadratic programming [PDF]
Mathematical Programming Computation, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Philip E. Gill, Elizabeth Wong
openaire +1 more source
Robust convex quadratically constrained programs [PDF]
Mathematical Programming, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Donald Goldfarb, Garud Iyengar
openaire +1 more source
Engineering Science and Technology, an International Journal, 2020 This paper proposes a convex approximation approach for solving the optimal power flow (OPF) problem in direct current (DC) networks with constant power loads by using a sequential quadratic programming approach.
Oscar Danilo Montoya
doaj +1 more source
Lifted Convex Quadratic Programming
CoRR, 2016 Symmetry is the essential element of lifted inference that has recently demon- strated the possibility to perform very efficient inference in highly-connected, but symmetric probabilistic models models. This raises the question, whether this holds for optimisation problems in general.
Martin Mladenov +2 more
openaire +2 more sources
On the minimum-norm solution of convex quadratic programming [PDF]
RAIRO - Operations Research, 2021 We discuss some basic concepts and present a numerical procedure for finding the minimum-norm solution of convex quadratic programs (QPs) subject to linear equality and inequality constraints. Our approach is based on a theorem of alternatives and on a convenient characterization of the solution set of convex QPs.
Saeed Ketabchi +2 more
openaire +1 more source
Secure beamforming design for IRS-assisted SWIPT Internet of things system
Tongxin xuebao, 2021 In order to meet the new requirements of intelligent signal processing deployment and physical layer security for green interconnection of things, a design method of secure beamforming was proposed to solve the problem of the shortage of sustainable ...
Zhengyu ZHU +4 more
doaj +2 more sources