Linearity embedded in nonconvex programs (Q2583177): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SNOPT / 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.1007/s10898-004-0864-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091687474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduced space branch and bound algorithm for global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction constraints for the global optimization of NLPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / 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: Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations / rank
 
Normal rank

Latest revision as of 14:13, 11 June 2024

scientific article
Language Label Description Also known as
English
Linearity embedded in nonconvex programs
scientific article

    Statements

    Identifiers