A computational analysis of LCP methods for bilinear and concave quadratic programming (Q1184453): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q1104870 / rank
Normal rank
 
Property / author
 
Property / author: Ana M. Faustino / rank
Normal rank
 
Property / author
 
Property / author: Joaquim Joao Júdice / rank
 
Normal rank
Property / author
 
Property / author: Ana M. Faustino / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0305-0548(91)90002-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057012359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilinear programming: An exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for solving bilinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the solution of bilinear programming problems by reduction to concave minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the bilinear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximization of A convex quadratic function under linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational analysis of LCP methods for bilinear and concave quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental investigation of enumerative methods for the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm for constrained concave quadratic global minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Links between linear bilevel and mixed 0-1 programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a Fundamental Theorem in Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New and Efficient Algorithm for a Class of Portfolio Selection Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:06, 15 May 2024

scientific article
Language Label Description Also known as
English
A computational analysis of LCP methods for bilinear and concave quadratic programming
scientific article

    Statements

    A computational analysis of LCP methods for bilinear and concave quadratic programming (English)
    0 references
    28 June 1992
    0 references
    sequential linear complementarity
    0 references
    bilinear programming
    0 references
    concave quadratic program
    0 references
    branch-and-bound
    0 references
    0 references
    0 references

    Identifiers