Suchergebnisse - Linear-Constrained Convex Quadratic Programming

Generalized linear‐constrained optimal power flow for distribution networks von Li, Biao, Wan, Can, Li, Yunyi, Jiang, Yibao, Yu, Peng

“… This paper proposes a novel generalized linear‐constrained optimal power flow (GLOPF) model for both radial and mesh distribution networks, which iteratively approaches the optimal solution to the original OPF problem. The first …”
Volltext

Smart Charging of EVs in Residential Distribution Systems Using the Extended Iterative Method von Zhang, Jian, Cui, Mingjian, Fang, Hualiang, He, Yigang

“… Smart charging of electrical vehicles (EVs) is critical to provide the secure and cost-effective operation for distribution systems. Three model objective …”
Volltext

Sparse Recovery: The Square of ℓ1/ℓ2 Norms von Jia, Jianqing, Prater-Bennette, Ashley, Shen, Lixin, Tripp, Erin E.

“… We detail two accompanying algorithms based on Dinkelbach’s procedure and a difference of convex functions strategy …”
Volltext

A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming von Barrios, J.G., Bello Cruz, J.Y., Ferreira, O.P., Németh, S.Z.

“… As an application, we study the convex quadratic programming problem under positive constraints. The numerical results suggest that the semi-smooth Newton method achieves …”
Volltext

A PRECONDITIONING FRAMEWORK FOR SEQUENCES OF DIAGONALLY MODIFIED LINEAR SYSTEMS ARISING IN OPTIMIZATION von BELLAVIA, STEFANIA, DE SIMONE, VALENTINA, DI SERAFINO, DANIELA, MORINI, BENEDETTA

“… Such sequences arise in several optimization methods, e.g., in affine-scaling methods for bound-constrained convex quadratic programming and bound-constrained linear least …”
Volltext

A Global Solution Algorithm for AC Optimal Power Flow through Linear Constrained Quadratic Programming von Barati, Masoud

“… We formulate the Alternating Current Optimal Power Flow Problem (ACOPF) as a Linear Constrained Quadratic Program (LCQP …”
Volltext

On safe tractable approximations of chance constraints von Nemirovski, Arkadi

“… ► Lagrangian approximation of quadratically perturbed scalar linear inequalities. ► Approximation of affinely perturbed conic quadratic/semidefinite inequalities …”
Volltext

Task Scheduling for Mobile Edge Computing with Multiple Links von Yang, Lichao, Zhang, Heli, Ji, Hong, Li, Xi

“… As the explosive growth of smart devices and new applications, traffic volume has been growing exponentially. Thus, mobile edge computing (MEC) technology …”
Volltext

MPTV: Matching Pursuit-Based Total Variation Minimization for Image Deconvolution von Dong Gong, Mingkui Tan, Qinfeng Shi, van den Hengel, Anton, Yanning Zhang

“… We formulate the inhomogeneous TV minimization problem as a convex quadratic constrained linear programming problem …”
Volltext

Interior algorithms for linear, quadratic, and linearly constrained convex programming von Ye, Yinyu

“… : convex quadratic and linearly constrained convex programs. These algorithms are polynomial-time algorithms if the objective function is convex quadratic …”
Volltext

Sparse Recovery: The Square of $$\ell _1/\ell _2$$ Norms von Jia, Jianqing, Prater-Bennette, Ashley, Shen, Lixin, Tripp, Erin E.

“… We detail two accompanying algorithms based on Dinkelbach’s procedure and a difference of convex functions strategy …”
Volltext

Sparse Recovery: The Square of \(\ell_1/\ell_2\) Norms von Jia, Jianqing, Prater-Bennette, Ashley, Shen, Lixin, Tripp, Erin E

“… We detail two accompanying algorithms based on Dinkelbach's procedure and a difference of convex functions strategy …”
Volltext

A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming von Barrios, J G, Bello Cruz, J Y, Ferreira, O P, Németh, S Z

“… As an application, we study the convex quadratic programming problem under positive constraints. The numerical results suggest that the semi-smooth Newton method achieves …”
Volltext

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints von Dahal, Hari, Liu, Wei, Xu, Yangyang

“… We give a damped proximal augmented Lagrangian method (DPALM) for solving problems with a weakly-convex objective and convex linear/nonlinear constraints …”
Volltext

Robust adaptive beamforming based on response vector optimization von Jingwei Xu, Guisheng Liao, Shengqi Zhu

“… To generate a better response vector, it is first established as a non-convex quadratically constrained quadratic programming problem, and then is transformed into a semidefinite programming problem …”
Volltext

Control theoretic splines: optimal control, statistics, and path planning (princeton series in applied mathematics). von Egerstedt, Magnus, Martin, Clyde

“… This book unifies these constructions in a comprehensive and accessible way, drawing from the latest methods and applications to show how they arise naturally in the theory of linear control systems …”
Volltext

Hybrid DE-SQP and hybrid PSO-SQP methods for solving dynamic economic emission dispatch problem with valve-point effects von Elaiw, A.M., Xia, X., Shehata, A.M.

“… ) problem taking into consideration valve-point effects is a complicated non-linear constrained multi-objective optimization problem with non-smooth and non-convex characteristics …”
Volltext

Algorithms for discrete nonlinear optimization in FICO Xpress von Belotti, Pietro, Berthold, Timo, Neves, Kelligton

“… ), mixed integer linear programming (MIP), convex quadratic programming (QP), convex quadratically constrained quadratic programming (QCQP …”
Volltext

Fluence map optimization (FMO) with dose-volume constraints in IMRT using the geometric distance sorting method von Lan, Yihua, Li, Cunhua, Ren, Haozheng, Zhang, Yong, Min, Zhifang

“… In each iteration step, an interior point method is adopted to solve each new linear constrained quadratic programming …”
Weitere Angaben

An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems von Lin, Meixia, Sun, Defeng, Toh, Kim-Chuan

“… . We prove that the least squares estimator is computable via solving an essentially constrained convex quadratic programming (QP) problem with ( d + 1 ) n variables, n ( n - 1 …”
Volltext