Skip to main content
SpringerLink
Log in

Global optimality conditions for nonlinear optimization problems

  • Special Issue
  • Published:
Evolutionary Intelligence Aims and scope Submit manuscript

Abstract

Based on the alternative theorem, global optimality conditions for nonlinear programming problems to be discussed in this article. Firstly, on the basis of the research of optimality conditions for polynomial optimization problems, the paper considers nonlinear programming over constrains which are not real polynomial functions. And then necessary global optimality conditions for nonlinear programming problems with non-polynomial constraints functions are proposed and sufficient global optimality conditions for polynomial objective function programming problems with non-polynomial constraints functions are developed by using the alternative theorem. Finally, necessary and sufficient global optimality conditions for 0–1 quadratic programming problems are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Kuhn HW, Tucker AW (1951) Nonlinear programming. University of California Press, California

    Google Scholar 

  2. Yang XQ (2004) Second-order global optimality conditions for optimization problems. J Glob Optim 30:271–284

    Article  MathSciNet  Google Scholar 

  3. Pinar MC (2004) Sufficient global optimality conditions for bivalent quadratic optimization. J Optim Theory Appl 122(2):433–440

    Article  MathSciNet  Google Scholar 

  4. Wu ZY (2007) Sufficent global optimality conditions for weakly convex minimization problems. J Glob Optim 39:427–440

    Article  Google Scholar 

  5. Alexanders Strekalovsky (1998) Global optimality conditions for nonconvex optimization. J Glob Optim 12:415–434

    Article  MathSciNet  Google Scholar 

  6. Schichl H, Neumaier A (2006) Transposition theorems and qualification-free optimality conditions. SIAM J Optim 17:1035–1055

    Article  MathSciNet  Google Scholar 

  7. Wu ZY, Jeyakumar V, Rubinov AM (2007) Sufficent conditions conditons for global optimality of bivalent nonconvex quadratic programs with inequality constraints. J Optim Theory Appl 133:123–130

    Article  MathSciNet  Google Scholar 

  8. Jeyakumar V, Srisatkunarajah S, Huy NQ (2007) Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems. J Math Anal Appl 335:779–788

    Article  MathSciNet  Google Scholar 

  9. Beck A, Teboulle M (2000) Global optimality conditions for quadratic optimization problems with binary constraints. SIAM J Optim 11:179–188

    Article  MathSciNet  Google Scholar 

  10. Bienstock D (2018) LP formulations for polynomial optimization problems. SIAM J Optim 28(2):1121–1150

    Article  MathSciNet  Google Scholar 

  11. David Yang G, Changzhi W (2017) On the triality theory for a quartic polynomial optimization problem. J Ind Manag Optim 8(1):229–242

    Article  MathSciNet  Google Scholar 

  12. Qi L, Fei W, Wang Y (2009) Z-eigenvalue methods for a global polynomial optimization problem. Mathemat Programm 118(2):301–316

    Article  MathSciNet  Google Scholar 

  13. Jeyakumar V, Rubinov AM (2006) Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints. J Glob Optim 36:471–481

    Article  MathSciNet  Google Scholar 

  14. Chen W, Zhang LS (2010) Global optimality conditions for quadratic o-1 optimization problems. J Glob Optim 46:191–206

    Article  MathSciNet  Google Scholar 

  15. Fang SC, Gao DY, Sheu RL (2017) Canonical dual approach to solving 0–1 quadratic programming problems. J Ind Manag Optim 4(1):125–142

    Article  MathSciNet  Google Scholar 

  16. Hsia Y, Wang YP (2013) A new penalty parameter for linearly constrained 0 and C1 quadratic programming problems. Optimiz Lett 7:765–778

    Article  Google Scholar 

  17. Wang C, Gao H (2019) Optimality conditions of multiobjective programming problems based on weakly convex. J Jilin University (Science Edition) 5:70–74

    Google Scholar 

  18. Jean-Pierre D, Jacques A, Lematre Bernard (1986) Convex quadratic programming with one constraint and bounded variables. Mathem Programm 36:90–104

    Article  MathSciNet  Google Scholar 

  19. Perkki AP, Pennanen T, Biagini S (2018) Duality and optimality conditions in stochastic optimization and mathematical finance. J Convex Analysis 25(2)

  20. Jeyakumar V, Li GY (2011) Necessary gobal optimality conditions for nonlinear programming problems with polynomial constraints. Mathem Programm 126:393–399

    Article  Google Scholar 

  21. Marshall M (2008) Positive Polynomials and Sums of Squares. Mathematical Surveys and Monographs https://doi.org/http://dx.doi.org/10.1090/surv/146 MathSciNet

Download references

Author information

Authors and Affiliations

  1. Fundamentals Department, Air Force Engineering University, Xi’an, 710051, China

    Haitao Zhong, Mingfa Zheng & Aoyu Zheng

  2. Department of Mathematics, Shanghai University, Shanghai, 200444, China

    Wei Chen

Authors
  1. Haitao Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mingfa Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Aoyu Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mingfa Zheng.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhong, H., Zheng, M., Chen, W. et al. Global optimality conditions for nonlinear optimization problems. Evol. Intel. 17, 291–301 (2024). https://doi.org/10.1007/s12065-022-00725-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12065-022-00725-y

Keywords

Search

Navigation