Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (Q4634141): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128145683, #quickstatements; #temporary_batch_1723924200075
 
(11 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Phillipe L. Toint / rank
Normal rank
 
Property / author
 
Property / author: Phillipe L. Toint / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Filtrane / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CUTEst / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ve08 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LANCELOT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AMPL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1704.06919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of unconstrained \(L_2 - L_p\) minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modeling Language for Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial-Update Newton Methods for Unary, Factorable, and Partially Separable Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic properties of bridge estimators in sparse high-dimensional regression models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Block Coordinate Descent for Minimizing Partially Separable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On High-order Model Regularization for Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic regularization of Newton method and its global performance / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2925648101 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128145683 / rank
 
Normal rank

Latest revision as of 21:15, 17 August 2024

scientific article; zbMATH DE number 7051503
Language Label Description Also known as
English
Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
scientific article; zbMATH DE number 7051503

    Statements

    Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (English)
    0 references
    0 references
    0 references
    0 references
    7 May 2019
    0 references
    complexity theory
    0 references
    non-Lipschitz functions
    0 references
    partially separable problems
    0 references
    0 references
    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
    0 references