Active constraints, indefinite quadratic test problems, and complexity (Q911993): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: William W. Hager / rank
Normal rank
 
Property / author
 
Property / author: Ioannis M. Roussos / rank
Normal rank
 
Property / author
 
Property / author: William W. Hager / rank
 
Normal rank
Property / author
 
Property / author: Ioannis M. Roussos / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NAPACK / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definiteness and semidefiniteness of quadratic forms revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inertia theorem for symmetric matrices and its application to nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inertia and Schur complement in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of large-scale quadratic programs for use as global optimization test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic equivalence in quadratic programming. I. A least-distance programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An active method of searching for the global minimum of a concave function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a quadratic formulation for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking local optimality in constrained quadratic programming is NP- hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3873927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3913524 / rank
 
Normal rank

Latest revision as of 14:21, 20 June 2024

scientific article
Language Label Description Also known as
English
Active constraints, indefinite quadratic test problems, and complexity
scientific article

    Statements

    Active constraints, indefinite quadratic test problems, and complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    The observation that at least s constraints are active when the Hessian of the Lagrangian has s negative eigenvalues at a local minimizer is used to obtain two results: (i) a class of nearly-concave quadratic minimization problem can be solved in polynomial time; (ii) a class of indefinite quadratic test problems can be constructed with a specified number of positive and negative eigenvalues and with a known global minimizer.
    0 references
    active constraints
    0 references
    complexity theory
    0 references
    negative eigenvalues
    0 references
    local minimizer
    0 references
    nearly-concave quadratic minimization
    0 references
    polynomial time
    0 references
    indefinite quadratic test problems
    0 references
    global minimizer
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references