The l1 exact G-penalty function method and G-invex mathematical programming problems

In this paper, we consider G-invex mathematical programming problems and show the efficiency of G-invexity notion in proving optimality results for such nonconvex optimization problems. Further, we introduce a new exact penalty function method, called the l₁ exact G-penalty function method and use i...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical and computer modelling Ročník 54; číslo 9-10; s. 1966 - 1978
Hlavní autor:	ANTCZAK, Tadeusz
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Kidlington Elsevier 01.11.2011
Témata:	Calculus of variations and optimal control computer techniques decision making Exact sciences and technology Mathematical analysis mathematical models Mathematics Methods of scientific computing (including symbolic computation, algebraic computation) Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming Numerical methods in mathematical programming, optimization and calculus of variations Sciences and techniques of general use system optimization Lower bound G-penalized optimization problem Optimization method Exact G-penalty function method Mathematical method Penalty method Numerical analysis Applied mathematics Optimal solution Absolute value G-penalty function Mathematical model G-invex function with respect to η Computer aided analysis Mathematical programming
ISSN:	0895-7177
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!