Search Results - "Generalized quadratic programming problem"

  • Showing 1 - 6 results of 6
Refine Results
  1. 1

    Second-Order Optimality Conditions for Infinite-Dimensional Quadratic Programs by An, Duong Thi Viet

    ISSN: 0022-3239, 1573-2878
    Published: New York Springer US 01.02.2022
    “…Second-order necessary and sufficient optimality conditions for local solutions and locally unique solutions of generalized quadratic programming problems in Banach spaces are established in this paper…”
    Get full text
    Journal Article
  2. 2

    Generalized quadratic programming problem with interval uncertainty by Kumar, P., Panda, G., Gupta, U. C.

    ISSN: 1098-7584
    Published: IEEE 01.07.2013
    “…In this paper, a quadratic programming model is considered, wherein all parameters and decision variables take values in intervals. Existence of optimal…”
    Get full text
    Conference Proceeding
  3. 3

    An Efficient Computational Procedure for a Generalized Quadratic Programming Problem by Barr, Robert O.

    ISSN: 0036-1402, 0363-0129, 1095-7138
    Published: Philadelphia Society for Industrial and Applied Mathematics 01.08.1969
    Published in SIAM journal on control (01.08.1969)
    Get full text
    Journal Article
  4. 4

    Computing optimal discrete readout weights in reservoir computing is NP-hard by Hadaeghi, Fatemeh, Jaeger, Herbert

    ISSN: 0925-2312, 1872-8286
    Published: Elsevier B.V 21.04.2019
    Published in Neurocomputing (Amsterdam) (21.04.2019)
    “…•The proof is by reduction from the unconstrained binary quadratic programming problem. We show NP-hardness of a generalized quadratic programming problem, which we called unconstrained n-ary quadratic programming (UNQP…”
    Get full text
    Journal Article
  5. 5

    A Generalization of Hoffman’s Lemma in Banach Spaces and Applications by Huy, Nguyen Quang, Tuan, Hoang Ngoc, Yen, Nguyen Dong

    ISSN: 0095-4616, 1432-0606
    Published: New York Springer US 01.04.2025
    Published in Applied mathematics & optimization (01.04.2025)
    “…) convergence of feasible descent methods for solving generalized quadratic programming problems…”
    Get full text
    Journal Article
  6. 6

    Computing optimal discrete readout weights in reservoir computing is NP-hard by Hadaeghi, Fatemeh, Jaeger, Herbert

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 04.09.2018
    Published in arXiv.org (04.09.2018)
    “…We show NP-hardness of a generalized quadratic programming problem, which we called Unconstrained N-ary Quadratic Programming (UNQP…”
    Get full text
    Paper