Additional information
| Author(s) | Bărbosu, Dan |
|---|
Soit I = (a,b) x (c,d), F(I) = {f | f : I->R} et D : F(I)->F(I) l’opérateur différence bidimensionnelle.
On note:
Kb(I) = {f E F(I) | (3)f1 : (a,b)->R, (3)fa: (c,d)->Ra.i.f(x,y) = f1(x) + f2(y) }.
Le but de la note est de démontrer l’égalité Kb(I) = ker D.
| Author(s) | Bărbosu, Dan |
|---|
You must be logged in to post a review.
Approximate Solutions for Multi-Objective Optimization Problems via Scalarizing and Nonscalarizing Methods
A product of strongly quasi-nonexpansive mappings in Hadamard spaces
Inertial viscosity fixed point algorithms for monotone inclusion, convex minimization, and image restoration problems
Holderian Stability for Parametric Optimization Models and Applications
A Novel Fixed-Point Based Two-Step Inertial Algorithm for Convex Bilevel Optimization in Deep Learning Data Classification
Double-step inertial algorithms for equilibrium and fixed point problems in Hilbert spaces
Accelerated forward-backward algorithm based on inertial and correction terms with linesearch for solving convex minimization problem and its application
A Dual-Projective Double Inertial Forward-Backward Splitting Algorithm for Variational Inclusion Problems with Applications to External Validation in Breast Cancer Diagnosis
Efficient Large-Scale Classification with Linex Least Square Twin Bounded Support Vector Machine
Classifying compressive strength of clay bricks using an inertial projected forward-backward algorithm

Reviews
There are no reviews yet.