Finite perturbation of convex programs (Q810372): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Characterization of solution sets of convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Necessary and Sufficient Qualification for Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty functions in nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal solutions of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple characterization of solutions sets of convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Perturbation of Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491338 / rank
 
Normal rank

Latest revision as of 09:08, 24 June 2024

scientific article
Language Label Description Also known as
English
Finite perturbation of convex programs
scientific article

    Statements

    Finite perturbation of convex programs (English)
    0 references
    1991
    0 references
    The aim is to study a characterization of the finite-perturbation property of a convex program. The main result: When the finite- perturbation property of linear programs holds, a finite perturbation of the objective function of a convex program leads to a solution of the original problem which minimizes the perturbation function over the set of solutions of the original problem. This generalizes a finite- termination property of the proximal point algorithm for linear programs and characterizes finite Tikhonov regularization of convex programs.
    0 references
    finite-perturbation property
    0 references
    finite-termination property
    0 references
    proximal point algorithm
    0 references
    finite Tikhonov regularization
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references