Search Results - "convex programming problems"

Robust beamforming design for multiple-input–single-output secrecy multicasting systems with simultaneous wireless information and power transmission by Zhu, Zhengyu, Chu, Zheng, Wang, Zhongyong, Cui, Jianhua

“… is minimised subject to the secrecy rate outage probability constraint for legitimate users and the harvested energy…”
Get full text

A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems by Mokhtarian, F. Sharifi, Goffin, J. L.

“…A cutting plane algorithm for minimizing a convex function subject to constraints defined by a separation oracle is presented…”
Get full text

On the path-following methods for linearly constrained convex programming problems by Zhu, Jishan

“…) problems which have the following standard form: Minimize f(x) subject to Ax = b, x $\ge$ 0. The purpose of this thesis…”
Get full text

A recurrent neural network for solving nonlinear convex programs subject to linear constraints by Xia, Y., Wang, J.

“…In this paper, we propose a recurrent neural network for solving nonlinear convex programming problems with linear constraints…”
Get full text

Embedded Model Predictive Control for a Wearable Artificial Pancreas by Chakrabarty, Ankush, Healey, Elizabeth, Shi, Dawei, Zavitsanou, Stamatina, Doyle, Francis J., Dassau, Eyal

“…While artificial pancreas (AP) systems are expected to improve the quality of life among people with type 1 diabetes mellitus (T1DM), the design of convenient…”
Get full text

Optimal portfolio trading subject to stochastic dominance constraints under second‐order autoregressive price dynamics by Singh, Arti, Dharmaraja, Selvamuthu

“…‐neutral and risk‐averse traders become convex programming problems, which have many theoretical and computational advantages over the general class of optimization problems…”
Get full text

Isotone Optimization in R : Pool-Adjacent-Violators Algorithm (PAVA) and Active Set Methods by Leeuw, Jan de, Hornik, Kurt, Mair, Patrick

“… weights, approaches for tie handling, and responses from repeated measurement designs. Since isotone optimization problems can be formulated as convex programming…”
Get full text

Nonlinear optimization and support vector machines by Piccialli, Veronica, Sciandrone, Marco

“… In this paper we present the convex programming problems underlying SVM focusing on supervised binary classification…”
Get full text

A recurrent neural network for nonlinear convex optimization subject to nonlinear inequality constraints by Xia, Youshen, Wang, Jun

“…This paper presents a novel recurrent neural network for solving nonlinear convex programming problems subject to nonlinear inequality constraints…”
Get full text

A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization by Mehrotra, Sanjay, Papp, Dávid

“…We present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems and use it to develop a novel algorithm for…”
Get full text

Optimal polarised pattern synthesis of wideband arrays via convex optimisation by Li, Mianquan, Chang, Yuliang, Li, Yongzhen, Dong, J, Wang, Xuesong

“… Both the optimisations of the sum and difference patterns are formulated as convex programming problems to obtain efficient solutions…”
Get full text

A parameterized proximal point algorithm for separable convex optimization by Bai, Jianchao, Zhang, Hongchao, Li, Jicheng

“…In this paper, we develop a parameterized proximal point algorithm (P-PPA) for solving a class of separable convex programming problems subject to linear and convex constraints…”
Get full text

Nonlinear optimization and support vector machines by Piccialli, Veronica, Sciandrone, Marco

“… In this paper we present the convex programming problems underlying SVM focusing on supervised binary classification…”
Get full text

Robust Transceiver Design for SC-FDE Multi-hop Full-Duplex Decode-and-Forward Relaying Systems by Wu, Peiran, Schober, Robert, Bhargava, Vijay K.

“…, the sum mean-square error (MSE) and the maximum MSE across the different hops, subject to separate transmit power constraints for the nodes…”
Get full text

Novel Interior Point Algorithms for Solving Nonlinear Convex Optimization Problems by Tahmasebzadeh, Sakineh, Malek, Alaeddin, Navidi, H. R.

“…This paper proposes three numerical algorithms based on Karmarkar’s interior point technique for solvingnonlinear convex programming problems subject to linear constraints…”
Get full text

Robust Beamforming Design for MISO Secrecy Multicasting Systems with Energy Harvesting by Zhengyu Zhu, Zheng Chu, Zhongyong Wang, Inkyu Lee

“… is minimized subject to the secrecy rate outage probability constraint for legitimate users and the harvested energy…”
Get full text

Robust MMSE design for full-duplex decode-and-forward SC-FDE relay systems by Peiran Wu, Schober, Robert, Bhargava, Vijay K.

“…) of the two hops subject to separate node transmit power constraints. We show that the equalization filters can be optimized individually at the receiving nodes and take the form of robust Wiener filters…”
Get full text

A one-layer recurrent neural network for convex programming by Liu, Qingshan, Wang, Jun

“…This paper presents a one-layer recurrent neural network for solving convex programming problems subject to linear equality and nonnegativity constraints…”
Get full text

A class of convexification and concavification methods for non-monotone optimization problems by Wu, Z. Y., Lee, H. W. J., Yang, X. M.

“… It is shown that some classes of non-monotone optimization problems can be converted into better structured optimization problems, such as, concave minimization problems, reverse convex programming…”
Get full text

A parameterized proximal point algorithm for separable convex optimization by Bai, Jianchao, Zhang, Hongchao, Li, Jicheng

“…In this paper, we develop a parameterized proximal point algorithm (P-PPA) for solving a class of separable convex programming problems subject to linear and convex constraints…”
Get full text