On the Complexity of an Inexact Restoration Method for Constrained Optimization (Q5210514): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q126413316, #quickstatements; #temporary_batch_1718112927348
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An inexact-restoration method for nonlinear bilevel programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sequential optimality conditions for smooth constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cone-Continuity Constraint Qualification and Algorithmic Consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilevel optimization with a multiobjective problem in the lower level / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact restoration for Euler discretization of box-constrained optimal control problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of the energy norm in trust-region and adaptive cubic regularization subproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assessing the reliability of general-purpose inexact restoration methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained optimization with integer and continuous variables using inexact restoration and projected gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local convergence of an inexact-restoration method and numerical experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Regularization and Active-set Methods with Complexity for Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible inexact-restoration method for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an efficient augmented Lagrangian method for convex quadratic programming / 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. I: Motivation, convergence and numerical results / 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: On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity bounds for second-order optimality in unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding first-order critical points in constrained nonlinear optimization / 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: A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal quadratic programming algorithms. With applications to variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new line search inexact restoration approach for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangians, box constrained QP and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact restoration method for minimization problems arising in electronic structure calculations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Projected Gradient Method with Inexact Restoration for Minimization with Nonconvex Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally Convergent Filter Method for Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. / 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: Inexact-restoration algorithm for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical optimality condition without constraint qualifications for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic regularization of Newton method and its global performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank

Revision as of 12:06, 21 July 2024

scientific article; zbMATH DE number 7154034
Language Label Description Also known as
English
On the Complexity of an Inexact Restoration Method for Constrained Optimization
scientific article; zbMATH DE number 7154034

    Statements

    On the Complexity of an Inexact Restoration Method for Constrained Optimization (English)
    0 references
    21 January 2020
    0 references
    complexity
    0 references
    continuous optimization
    0 references
    constrained optimization
    0 references
    first-order methods
    0 references
    inexact restoration methods
    0 references
    regularization
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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