A comparative study of several semi-infinite nonlinear programming algorithms (Q1102202): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q171928
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Toshihide Ibaraki / 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/0377-2217(88)90010-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965209365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact penalty function for semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projected lagrangian algorithm for semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for optimization problems with functional inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4747130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive quadratic programming algorithm for semi-infinite optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3873909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementable<i>L</i><sub>∞</sub>penalty-function method for semi-infinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent SQP method for semi-infinite nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720311 / rank
 
Normal rank

Latest revision as of 16:06, 18 June 2024

scientific article
Language Label Description Also known as
English
A comparative study of several semi-infinite nonlinear programming algorithms
scientific article

    Statements

    A comparative study of several semi-infinite nonlinear programming algorithms (English)
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    computational comparison
    0 references
    semi-infinite nonlinear programming algorithms
    0 references
    global convergence
    0 references
    feasible direction
    0 references
    successive quadratic programming
    0 references
    Robustness
    0 references
    relative efficiency
    0 references

    Identifiers