Placeholder

Optimization problems, first order approximated optimization problems and their connections


Emilia-Loredana PopDorel I. Duca


Abstract

carpathian_2012_28_1_133_141_abstract

In 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).

Additional Information

Author(s)

Duca, Dorel I., Pop, Emilia-Loredana