A globally convergent penalty-free method for optimization with equality constraints and simple bounds (Q267115): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65K05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6566433 / rank
 
Normal rank
Property / zbMATH Keywords
 
nonlinear programming
Property / zbMATH Keywords: nonlinear programming / rank
 
Normal rank
Property / zbMATH Keywords
 
constrained optimization
Property / zbMATH Keywords: constrained optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
penalty-free algorithm
Property / zbMATH Keywords: penalty-free algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
trust region method
Property / zbMATH Keywords: trust region method / rank
 
Normal rank
Property / zbMATH Keywords
 
global convergence
Property / zbMATH Keywords: global convergence / rank
 
Normal rank

Revision as of 15:42, 27 June 2023

scientific article
Language Label Description Also known as
English
A globally convergent penalty-free method for optimization with equality constraints and simple bounds
scientific article

    Statements

    A globally convergent penalty-free method for optimization with equality constraints and simple bounds (English)
    0 references
    0 references
    0 references
    8 April 2016
    0 references
    0 references
    nonlinear programming
    0 references
    constrained optimization
    0 references
    penalty-free algorithm
    0 references
    trust region method
    0 references
    global convergence
    0 references