Necessary global optimality conditions for nonlinear programming problems with polynomial constraints (Q623367): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/mp/JeyakumarL11, #quickstatements; #temporary_batch_1731505720702
 
(4 intermediate revisions by 4 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-009-0283-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066821525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional programming with convex quadratic forms and functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4210476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Global Optimality and Extracting Solutions in GloptiPoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for global optimality. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth vector functions and continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing polynomials via sum of squares over the gradient ideal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of global optimization. Vol. 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transposition Theorems and Qualification‐Free Optimality Conditions / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mp/JeyakumarL11 / rank
 
Normal rank

Latest revision as of 14:56, 13 November 2024

scientific article
Language Label Description Also known as
English
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
scientific article

    Statements

    Necessary global optimality conditions for nonlinear programming problems with polynomial constraints (English)
    0 references
    14 February 2011
    0 references
    necessary global optimality conditions
    0 references
    polynomial constraints
    0 references
    polynomial over-estimators
    0 references
    semi-algebraic geometry
    0 references
    sums of squares polynomials
    0 references
    0 references
    0 references

    Identifiers