On perturbed steepest descent methods with inexact line search for bilevel convex optimization (Q3112499): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1080/02331934.2010.536231 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047859246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Incremental Gradient Methods for Least Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient Convergence in Gradient methods with Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Convergent Incremental Gradient Method with a Constant Step Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full convergence of the steepest descent method with inexact line searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable signal recovery from incomplete and inaccurate measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of bilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simultaneous projections method for linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed version of Bregman's method for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: For most large underdetermined systems of equations, the minimal 𝓁<sub>1</sub>‐norm near‐solution approximates the sparsest near‐solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signal Recovery and the Large Sieve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two facts on the convergence of the Cauchy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simultaneous Iterative Method for Computing Projections on Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Methods in Image Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Subgradient Methods for Nondifferentiable Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence results for scaled gradient algorithms in positron emission tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear total variation based noise removal algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental gradient algorithms with stepsizes bounded away from zero / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error stability properties of generalized gradient-type algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Statistical Model for Positron Emission Tomography / rank
 
Normal rank

Latest revision as of 20:21, 4 July 2024

scientific article
Language Label Description Also known as
English
On perturbed steepest descent methods with inexact line search for bilevel convex optimization
scientific article

    Statements

    On perturbed steepest descent methods with inexact line search for bilevel convex optimization (English)
    0 references
    0 references
    10 January 2012
    0 references
    0 references
    convex optimization
    0 references
    bilevel
    0 references
    tomography
    0 references
    0 references
    0 references
    0 references