scholarly journals Role of twice fréchet-differentiable mappings in general auxiliary problem principle

2003 ◽  
Vol 45 (10-11) ◽  
pp. 1749-1756
Author(s):  
E.-B. Lin ◽  
R.U. Verma
2004 ◽  
Vol 2004 (2) ◽  
pp. 143-148 ◽  
Author(s):  
Ram U. Verma

Let T:K→H be a mapping from a nonempty closed convex subset K of a finite-dimensional Hilbert space H into H. Let f:K→ℝ be proper, convex, and lower semicontinuous on K and let h:K→ℝ be continuously Frećhet-differentiable on K with h′ (gradient of h), α-strongly monotone, and β-Lipschitz continuous on K. Then the sequence {xk} generated by the general auxiliary problem principle converges to a solution x* of the variational inequality problem (VIP) described as follows: find an element x*∈K such that 〈T(x*),x−x*〉+f(x)−f(x*)≥0 for all x∈K.


2021 ◽  
Vol 11 (10) ◽  
pp. 4509
Author(s):  
Anna Rita Di Fazio ◽  
Chiara Risi ◽  
Mario Russo ◽  
Michele De Santis

This paper addresses the problem of optimizing the voltage profile of radially-operated distribution systems by acting on the active and reactive powers provided by distributed energy resources (DERs). A novel voltage optimization procedure is proposed by adopting a decentralized control strategy. To this aim, a centralized voltage optimization problem (VOP), minimizing the distance of all the nodal voltages from their reference values, is firstly formulated as a strictly-convex quadratic program. Then, the centralized VOP is rewritten by partitioning the network into voltage control zones (VCZs) with pilot nodes. To overcome the lack of strictly convexity determined by the reduction to the pilot nodes, the dual centralized VOP working on the augmented Lagrangian function is reformulated and iteratively solved by the method of multipliers. Finally, a fully-distributed VOP solution is obtained by applying a distributed algorithm based on the auxiliary problem principle, which allows for solving in each VCZ a quadratic programming problem of small dimension and to drive the VCZ solutions toward the overall optimum by an iterative coordination process that requires to exchange among the VCZs only scalar values. The effectiveness and feasibility of the proposed method have been demonstrated via numerical tests on the IEEE 123-bus system.


Optimization ◽  
2004 ◽  
Vol 53 (5-6) ◽  
pp. 603-623 ◽  
Author(s):  
A. Kaplan ◽  
R. Tichatschke

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Zong-Ke Bao ◽  
Ming Huang ◽  
Xi-Qiang Xia

We suggest and analyze a predictor-corrector method for solving nonsmooth convex equilibrium problems based on the auxiliary problem principle. In the main algorithm each stage of computation requires two proximal steps. One step serves to predict the next point; the other helps to correct the new prediction. At the same time, we present convergence analysis under perfect foresight and imperfect one. In particular, we introduce a stopping criterion which gives rise toΔ-stationary points. Moreover, we apply this algorithm for solving the particular case: variational inequalities.


2020 ◽  
Vol 44 (4) ◽  
pp. 571-579
Author(s):  
T. TEIMOURI-AZADBAKHT ◽  
A. G GHAZANFARI

Let X be a Hilbert C∗-module on C∗-algebra A and p ∈ A. We denote by Dp(A,X) the set of all continuous functions f : A → X, which are Fréchet differentiable on a open neighborhood U of p. Then, we introduce some generalized semi-inner products on Dp(A,X), and using them some Grüss type inequalities in semi-inner product C∗-module Dp(A,X) and Dp(A,Xn) are established.


Sign in / Sign up

Export Citation Format

Share Document