One approach for solving optimization problems with apriori estimates of approximation of admissible set (Q2442500): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: One modification of the penalty shifting method for problems of nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in the penalty method with approximation of the feasible set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in the method of centers with approximation of the set of admissible solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control of the minimization process in the parametrized method of centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms with combination, parametrization, and two-sided approximation in the center method. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967008 / rank
 
Normal rank

Latest revision as of 13:04, 7 July 2024

scientific article
Language Label Description Also known as
English
One approach for solving optimization problems with apriori estimates of approximation of admissible set
scientific article

    Statements

    One approach for solving optimization problems with apriori estimates of approximation of admissible set (English)
    0 references
    0 references
    3 April 2014
    0 references
    methods of sequential unconstrained minimization
    0 references
    penalty function method
    0 references
    method of centers
    0 references
    solution of an optimization problem with a given accuracy
    0 references
    satisfactory approximation of the admissible set
    0 references
    feasible stopping criterion
    0 references

    Identifiers