Results 31 to 40 of about 1,126 (142)

Distributed State Estimation for Bilinear Power System Models Based on Weighted Least Absolute Value

Applied Sciences
Accurate, scalable, and outlier-robust state estimation (SE) is critical for large AC power systems with mixed SCADA and PMU measurements. This paper proposes D-BSE-L1, a distributed robust state estimator for the bilinear AC model.
Shijie Gao, Zhihua Deng, Yunzhe Zhang, Pan Wang   +3 more
doaj   +1 more source

An ADMM-based heuristic algorithm for optimization problems over nonconvex second-order cone

Open Computer Science
The nonconvex second-order cone (nonconvex SOC) is a nonconvex extension to the convex second-order cone, in the sense that it consists of any vector divided into two sub-vectors for which the Euclidean norm of the first sub-vector is at least as large ...
Alzalg Baha, Benakkouche Lilia
doaj   +1 more source

A successive linear/convex programming framework under a voltage–current representation for loss-minimizing optimal power flow

International Journal of Electrical Power & Energy Systems
A contraction-certified successive linear/convex programming (SCP) framework is proposed for loss-minimizing optimal power flow (OPF) under a voltage–current representation.
Seungchan Jo, Jae-Young Oh, Gyu-Sub Lee
doaj   +1 more source

Learning to Pursue AC Optimal Power Flow Solutions With Feasibility Guarantees

IEEE Open Journal of Control Systems
This paper focuses on an AC optimal power flow (OPF) problem for distribution feeders equipped with controllable distributed energy resources (DERs). We consider a solution method that is based on a continuous approximation of the projected gradient flow
Damola Ajeyemi, Yiting Chen, Antonin Colot, Jorge Cortes, Emiliano Dall'Anese   +4 more
doaj   +1 more source

A Provable Semi-Infinite Programming Approach for Solving Constrained Dynamic Games

Games
Many engineering problems must account for the non-cooperative decisions and actions of multiple players. These problems can be modeled within a game-theoretic framework.
Tyler C. Gardner, Matthew W. Harris, Logan Lancaster   +2 more
doaj   +1 more source

Convex Quadratic Sets and the Complexity of Mixed Integer Convex Quadratic Programming

SIAM Journal on Optimization
In pure integer linear programming it is often desirable to work with polyhedra that are full-dimensional, and it is well known that it is possible to reduce any polyhedron to a full-dimensional one in polynomial time. More precisely, using the Hermite normal form, it is possible to map a non full-dimensional polyhedron to a full-dimensional isomorphic
openaire   +3 more sources

A trade-off between line hardening and dynamic line rating by a new convex optimization model for resilient micro-grid-oriented expansion planning of reconfigurable smart distribution networks incorporated with renewable energy sources

Next Energy
Because of budget and right-of-way limitations, smart-grid technologies (SGTs) are widely incorporated in today’s distribution systems in order to satisfy the load demand growth and meet the network’s operational and reinforcement planning requirements ...
Saeed Behzadi, Amir Bagheri
doaj   +1 more source

Joint Optimization of Radar and Jammer Space-time Cooperative Beamforming for a Multitasking Dynamic Scene

Leida xuebao
The modern radar confrontation situation is complex and changeable, and inter-system combat has become a basic feature. The overall system performance affects the initiative on the battlefield and even the final victory or defeat.
Xiaorong LIAO, Guohao SUN, Suchuan ZHONG, Xianxiang YU, Ming LI   +4 more
doaj   +1 more source

Fractional programming with convex quadratic forms and functions

European Journal of Operational Research, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Department of Decision and Information Sciences, University of Florida, Gainesville, FL 32611, USA ( host institution ), Benson, Harold P.   +1 more
openaire   +2 more sources

Algorithms for Convex Quadratic Programming

, 2014
The main contribution of this thesis is the development of a new algorithm for solving convex quadratic programs. It consists in combining the method of multipliers with an infeasible active-set method. Our approach is iterative. In each step we calculate an augmented Lagrange function.
openaire   +2 more sources