A second order η -approximation method for constrained optimization problems involving second order invex functions

Tadeusz Antczak

Applications of Mathematics (2009)

  • Volume: 54, Issue: 5, page 433-445
  • ISSN: 0862-7940

Abstract

top
A new approach for obtaining the second order sufficient conditions for nonlinear mathematical programming problems which makes use of second order derivative is presented. In the so-called second order η -approximation method, an optimization problem associated with the original nonlinear programming problem is constructed that involves a second order η -approximation of both the objective function and the constraint function constituting the original problem. The equivalence between the nonlinear original mathematical programming problem and its associated second order η -approximated optimization problem is established under second order invexity assumption imposed on the functions constituting the original optimization problem.

How to cite

top

Antczak, Tadeusz. "A second order $\eta $-approximation method for constrained optimization problems involving second order invex functions." Applications of Mathematics 54.5 (2009): 433-445. <http://eudml.org/doc/37831>.

@article{Antczak2009,
abstract = {A new approach for obtaining the second order sufficient conditions for nonlinear mathematical programming problems which makes use of second order derivative is presented. In the so-called second order $\eta $-approximation method, an optimization problem associated with the original nonlinear programming problem is constructed that involves a second order $\eta $-approximation of both the objective function and the constraint function constituting the original problem. The equivalence between the nonlinear original mathematical programming problem and its associated second order $\eta $-approximated optimization problem is established under second order invexity assumption imposed on the functions constituting the original optimization problem.},
author = {Antczak, Tadeusz},
journal = {Applications of Mathematics},
keywords = {mathematical programming; second order $\eta $-approximated optimization problem; second order invex function; second order optimality conditions; second order -approximated optimization problem; second order invex function; second order optimality conditions},
language = {eng},
number = {5},
pages = {433-445},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {A second order $\eta $-approximation method for constrained optimization problems involving second order invex functions},
url = {http://eudml.org/doc/37831},
volume = {54},
year = {2009},
}

TY - JOUR
AU - Antczak, Tadeusz
TI - A second order $\eta $-approximation method for constrained optimization problems involving second order invex functions
JO - Applications of Mathematics
PY - 2009
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 54
IS - 5
SP - 433
EP - 445
AB - A new approach for obtaining the second order sufficient conditions for nonlinear mathematical programming problems which makes use of second order derivative is presented. In the so-called second order $\eta $-approximation method, an optimization problem associated with the original nonlinear programming problem is constructed that involves a second order $\eta $-approximation of both the objective function and the constraint function constituting the original problem. The equivalence between the nonlinear original mathematical programming problem and its associated second order $\eta $-approximated optimization problem is established under second order invexity assumption imposed on the functions constituting the original optimization problem.
LA - eng
KW - mathematical programming; second order $\eta $-approximated optimization problem; second order invex function; second order optimality conditions; second order -approximated optimization problem; second order invex function; second order optimality conditions
UR - http://eudml.org/doc/37831
ER -

References

top
  1. Antczak, T., 10.1081/NFA-200042183, Numer. Funct. Anal. Optimization 25 (2004), 423-438. (2004) MR2106268DOI10.1081/NFA-200042183
  2. Bazaraa, M. S., Sherali, H. D., Shetty, C. M., Nonlinear Programming. Theory and Algorithms, John Wiley & Sons New York (1993). (1993) Zbl0774.90075MR2218478
  3. Bector, C. R., Bector, B. K., (Generalized)-bonvex functions and second order duality for a nonlinear programming problem, Congr. Numerantium 52 (1985), 37-52. (1985) 
  4. Bector, C. R., Bector, M. K., On various duality theorems for second order duality in nonlinear programming, Cah. Cent. Etud. Rech. Opér. 28 (1986), 283-292. (1986) Zbl0622.90068MR0885768
  5. Bector, C. R., Chandra, S., Generalized bonvex functions and second order duality in mathematical programming, Res. Rep. 85-2 Department of Actuarial and Management Sciences, University of Manitoba Winnipeg (1985). (1985) 
  6. Bector, C. R., Chandra, S., (Generalized) bonvexity and higher order duality for fractional programming, Opsearch 24 (1987), 143-154. (1987) Zbl0638.90095MR0918321
  7. Ben-Israel, A., Mond, B., 10.1017/S0334270000005142, J. Aust. Math. Soc. Ser. B 28 (1986), 1-9. (1986) Zbl0603.90119MR0846778DOI10.1017/S0334270000005142
  8. Ben-Tal, A., 10.1007/BF00934107, J. Optimization Theory Appl. 31 (1980), 143-165. (1980) Zbl0416.90062MR0600379DOI10.1007/BF00934107
  9. Craven, B. D., 10.1017/S0004972700004895, Bull. Aust. Math. Soc. 24 (1981), 357-366. (1981) Zbl0452.90066MR0647362DOI10.1017/S0004972700004895
  10. Hanson, M. A., 10.1016/0022-247X(81)90123-2, J. Math. Anal. Appl. 80 (1981), 545-550. (1981) Zbl0463.90080MR0614849DOI10.1016/0022-247X(81)90123-2
  11. Mangasarian, O. L., Nonlinear Programming, McGraw-Hill New York (1969). (1969) Zbl0194.20201MR0252038
  12. Martin, D. H., 10.1007/BF00941316, J. Optimization Theory Appl. 47 (1985), 65-76. (1985) Zbl0552.90077MR0802390DOI10.1007/BF00941316

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.