Skip to main content
Log in

Global optimality conditions for cubic minimization problem with box or binary constraints

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this article, we provide optimality conditions for global solutions to cubic minimization problems with box or binary constraints. Our main tool is an extension of the global subdifferential approach, developed by Jeyakumar et al. (J Glob Optim 36:471–481, 2007; Math Program A 110:521–541, 2007). We also derive optimality conditions that characterize global solutions completely in the case where the cubic objective function contains no cross terms. Examples are given to demonstrate that the optimality conditions can effectively be used for identifying global minimizers of certain cubic minimization problems with box or binary constraints.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Canfield R.A.: Multipoint cubic surrogate function for sequential approximate optimization. Struct. Multidiscip. Optim. 27, 326–336 (2004)

    Article  Google Scholar 

  2. Nesterov Yu.: Accelerating the cubic regularization of Newtons method on convex problems. Math. Program. 112(1), 159–181 (2008)

    Article  Google Scholar 

  3. Lin C.-S., Chang P.-R., Luh J.Y.S.: Formulation and optimization of cubic polynomial joint trajectories for industrial robots. IEEE Transact. Autom. Control AC-28(12), 1066–1074 (1983)

    Article  Google Scholar 

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

    Article  Google Scholar 

  5. Hiriart-Urruty J.B.: Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints. J. Glob. Optim. 21, 445–455 (2001)

    Article  Google Scholar 

  6. Hiriart-Urruty J.B.: Conditions for global optimality 2. J. Glob. Optim. 13, 349–367 (1998)

    Article  Google Scholar 

  7. Strekalovsky A.: Global optimality conditions for nonconvex optimization. J. Glob. Optim. 12, 415–434 (1998)

    Article  Google Scholar 

  8. Jeyakumar V., Rubinov A.M., Wu Z.Y.: Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints. J. Glob. Optim. 36, 471–481 (2006)

    Article  Google Scholar 

  9. Wu Z.Y., Jeyakumar V., Rubinov A.M.: Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints. J. Optim. Theory Appl. 133, 123–130 (2007)

    Article  Google Scholar 

  10. Jeyakumar V., Rubinov A.M., Wu Z.Y.: Nonconvex quadratic minimization with quadratic constraints: global optimality conditions. Math. Program. A 110(3), 521–541 (2007)

    Article  Google Scholar 

  11. Wu Z.Y.: Sufficient global optimality conditions for weakly convex minimization problems. J. Glob. Optim. 39, 427–440 (2007)

    Article  Google Scholar 

  12. Bertsekas, D.P., Nedic, A., Ozdaglar, A.E.: Convex Analysis and Optimization. Athena Scientific, Belmont, MA, USA (2003)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yanjun Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, Y., Liang, Z. Global optimality conditions for cubic minimization problem with box or binary constraints. J Glob Optim 47, 583–595 (2010). https://doi.org/10.1007/s10898-009-9480-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-009-9480-5

Keywords

Navigation