EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search
  • Unconstrained formulation of s...
  • More details
Cover Image

Unconstrained formulation of standard quadratic optimization problems

Year of publication:
2012
Authors: Bomze, Immanuel ; Grippo, Luigi ; Palagi, Laura
Published in:
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. - Springer. - Vol. 20.2012, 1, p. 35-51
Publisher: Springer
Subject: Standard quadratic optimization | Maximum clique | Exact penalization
Saved in:
  • More details
Extent:
text/html
Type of publication: Article
Source:
RePEc - Research Papers in Economics
Persistent link: https://www.econbiz.de/10010557929
    • EndNote
    • BibTeX
    • Zotero, Mendeley, RefWorks, ...
    • Text
Saved in favorites
    Similar items by subject
    • New analysis on sparse solutions to random standard quadratic optimization problems and extensions

      Chen, Xin, (2015)

    • Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems

      Klerk, Etienne de, (2014)

    • Exact penalization of generalized Nash equilibrium problems

      Ba, Qin, (2022)

    • More ...
    Similar items by person
    • Unconstrained formulation of standard quadratic optimization problems

      Bomze, Immanuel M., (2012)

    • Unconstrained formulation of standard quadratic optimization problems

      Bomze, Immanuel M., (2012)

    • Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems

      Grippo, Luigi, (2009)

    • More ...
    A service of the
    zbw
    FAQ-Assistent (beta)
    • Sitemap
    • Plain language
    • Accessibility
    • Contact us
    • Imprint
    • Privacy

    Loading...