A first order method for finding minimal norm-like solutions of convex optimization problems (Q463716): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q170028
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-013-0708-2 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Regularization tools / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2129704204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel programming: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite perturbation of convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Regularization of Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum norm solution of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Perturbation of Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Technique for the Numerical Solution of Certain Integral Equations of the First Kind / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125663 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-013-0708-2 / rank
 
Normal rank

Latest revision as of 19:20, 9 December 2024

scientific article
Language Label Description Also known as
English
A first order method for finding minimal norm-like solutions of convex optimization problems
scientific article

    Statements

    A first order method for finding minimal norm-like solutions of convex optimization problems (English)
    0 references
    0 references
    0 references
    17 October 2014
    0 references
    bilevel optimization
    0 references
    complexity analysis
    0 references
    convex minimization
    0 references
    minimal norm solution
    0 references

    Identifiers

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