Additional Information
| Author(s) | Duca, Dorel I., Pop, Emilia-Loredana |
|---|
Optimization problems, first order approximated optimization problems and their connections
Emilia-Loredana Pop ♦ Dorel I. Duca
Abstract
carpathian_2012_28_1_133_141_abstractIn this paper, we attach to the optimization problem min f(x) s. t. x ∈ X g(x) 5 0 h(x) = 0, where X is a subset of Rn, f : X → R, g = (g1, …, gm) : X → Rm and h = (h1, …, hq) : X → Rq are functions, the (0, 1) − η− approximated optimization problem (AP). We will study the connections between the optimal solutions for Problem (AP), the saddle points for Problem (AP), optimal solutions for Problem (P) and saddle points for Problem (P).
Recently posted
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration