A Level-Set Method for Convex Optimization with a Feasible Solution Path (Q4562247): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128759846, #quickstatements; #temporary_batch_1724888006188
 
(7 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: RCV1 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SPGL1 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UCI-ml / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational Properties of Value Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Ascending Parameter Method for Solving Constrained Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing and First Order Methods: A Unified Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonlinear knapsack problem - algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Programming for Communication Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional gradient algorithms for norm-regularized smooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New variants of bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Stochastic Approximation Approach to Stochastic Programming / 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: Smooth minimization of non-smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual subgradient methods for convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving large-scale finite minimax problems using exponential smoothing / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Efficient” Subgradient Methods for General Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neyman-Pearson classification, convexity and stochastic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probing the Pareto Frontier for Basis Pursuit Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Optimization with Least-Squares Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146571 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/17m1152334 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2903665793 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128759846 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:48, 29 August 2024

scientific article; zbMATH DE number 6995705
Language Label Description Also known as
English
A Level-Set Method for Convex Optimization with a Feasible Solution Path
scientific article; zbMATH DE number 6995705

    Statements

    A Level-Set Method for Convex Optimization with a Feasible Solution Path (English)
    0 references
    0 references
    0 references
    0 references
    19 December 2018
    0 references
    constrained convex optimization
    0 references
    level-set technique
    0 references
    first-order methods
    0 references
    complexity analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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