Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Jointly constrained bilinear programs and related problems: An overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite convergence of algorithms for nonlinear programs and variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concavity cuts for disjoint bilinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A symmetrical linear maxmin approach to disjoint bilinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for analysing decisions under risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear max—min problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilinear programming: An exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / 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: A cutting plane algorithm for solving bilinear programs / 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: Quasi-concave minimization subject to linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium Points of Bimatrix Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-person nonzero-sum games and quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple finite cone covering algorithm for concave minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order conditions for isolated locally optimal solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reformulation-linearization technique for bilinear programming problems / 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: Optimal Facility Location with Concave Costs / 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: Q5342287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bilinear programming problem / 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: A linear programming approach to solving bilinear programmes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for solving rank two and rank three bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms / rank
 
Normal rank

Revision as of 13:03, 27 June 2024

scientific article
Language Label Description Also known as
English
Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
scientific article

    Statements

    Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (English)
    0 references
    0 references
    0 references
    14 November 2007
    0 references
    Linear programming
    0 references
    Bilinear programming
    0 references
    Cutting plane
    0 references
    Polar cuts
    0 references
    Lower bounding
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers