Results 31 to 40 of about 19,699 (306)
Proposed shunt rounding technique for large-scale security constrained loss minimization [PDF]
The official published version can be obtained from the link below - Copyright @ 2010 IEEE.Optimal reactive power flow applications often model large numbers of discrete shunt devices as continuous variables, which are rounded to their nearest discrete ...
Irving, MR +4 more
core +1 more source
The present paper is divided into two parts. First, we introduce implicit and explicit iterative schemes based on the regularization for solving equilibrium and constrained convex minimization problems.
Ming Tian
doaj +1 more source
Robust solutions to box-constrained stochastic linear variational inequality problem
We present a new method for solving the box-constrained stochastic linear variational inequality problem with three special types of uncertainty sets.
Mei-Ju Luo, Yan Zhang
doaj +1 more source
The Ball-Relaxed Gradient-Projection Algorithm for Split Feasibility Problem
In this paper, we concern with the split feasibility problem (SFP) whenever the convex sets involved are composed of level sets. By applying Gradient-projection algorithm which is used to solve constrained convex minimization problem of a real valued ...
Xiaochun Li, Xiaoxiao Liu, Fugen Gao
doaj +1 more source
A comparison of classical scheduling approaches in power-constrained block-test scheduling [PDF]
Classical scheduling approaches are applied here to overcome the problem of unequal-length block-test scheduling under power dissipation constraints. List scheduling-like approaches are proposed first as greedy algorithms to tackle the fore mentioned ...
Wang, Xiaojun +6 more
core +1 more source
Weak and Strong Superiorization: Between Feasibility-Seeking and Minimization
We review the superiorization methodology, which can be thought of, in some cases, as lying between feasibility-seeking and constrained minimization. It is not quite trying to solve the full edged constrained minimization problem; rather, the task is to ...
Censor Yair
doaj +1 more source
New iterative methods for equilibrium and constrained convex minimization problems [PDF]
The gradient-projection algorithm (GPA) plays an important role in solving constrained convex minimization problems. In this paper, we combine the GPA and averaged mapping approach to propose implicit and explicit composite iterative schemes for finding ...
Maryam Yazdi
core +1 more source
On the Solution of the Eigenvalue Assignment Problem for Discrete-Time Systems
The output feedback eigenvalue assignment problem for discrete-time systems is considered. The problem is formulated first as an unconstrained minimization problem, where a three-term nonlinear conjugate gradient method is proposed to find a local ...
El-Sayed M. E. Mostafa +2 more
doaj +1 more source
A new iterative method for generalized equilibrium and constrained convex minimization problems [PDF]
The gradient-projection algorithm (GPA) plays an important role in solving constrained convex minimization problems. In this paper, we combine the GPA and averaged mapping approach to propose an explicit composite iterative scheme for finding a common ...
Yazdi, M.
core +2 more sources
We introduced an implicit and an explicit iteration method based on the hybrid steepest descent method for finding a common element of the set of solutions of a constrained convex minimization problem and the set of solutions of a split variational ...
Jitsupa Deepho, Poom Kumam
doaj +1 more source

