Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method (Q1963110): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Infinite Programming: Theory, Methods, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy optimization and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical treatment of a class of semi‐infinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3858016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting-plane method for quadratic semi infinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxed cutting plane method for solving linear semi-infinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact approach to solving linear semi-infinite programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving convex quadratic semi-infinite programming probelms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3873909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Semi-Infinite Programming Problems: An Algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0898-1221(99)00203-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971468044 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:17, 30 July 2024

scientific article
Language Label Description Also known as
English
Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
scientific article

    Statements

    Identifiers