On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
From MaRDI portal
Publication:3225248
DOI10.1137/11082381XzbMath1236.90118OpenAlexW2004357692WikidataQ58185712 ScholiaQ58185712MaRDI QIDQ3225248
Coralia Cartis, Nicholas I. M. Gould, Phillipe L. Toint
Publication date: 16 March 2012
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/11082381x
nonsmooth optimizationnonlinear programmingexact penalty methodsglobal rate of convergencetrust region methodssteepest descent methodsglobal complexity boundsquadratic regularization methods
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on necessary conditions (49M05) Numerical methods based on nonlinear programming (49M37) Implicit function theorems; global Newton methods on manifolds (58C15)
Related Items
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron, Linearly Constrained Non-Lipschitz Optimization for Image Restoration, A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization, First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems, The multiproximal linearization method for convex composite problems, Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization, Proximal gradient algorithm with trust region scheme on Riemannian manifold, A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities, A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations, Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization, Joint synthesis of trajectory and controlled invariant funnel for discrete‐time systems with locally Lipschitz nonlinearities, Consistent fusion method with uncertainty elimination for distributed multi-sensor systems, The evaluation complexity of finding high-order minimizers of nonconvex optimization, Local convergence analysis of an inexact trust-region method for nonsmooth optimization, Penalty methods with stochastic approximation for stochastic nonlinear programming, Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares, Relax-and-split method for nonconvex inverse problems, Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria, On the complexity of finding first-order critical points in constrained nonlinear optimization, On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization, A note on the smoothing quadratic regularization method for non-Lipschitz optimization, Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization, Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization, Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions, Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints, Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization, A derivative-free trust-region algorithm for composite nonsmooth optimization, An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity, Smoothing methods for nonsmooth, nonconvex minimization, Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization, Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models, Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization, On the Complexity of an Inexact Restoration Method for Constrained Optimization, Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations, Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods, Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case, Variable Metric Forward-Backward Algorithm for Composite Minimization Problems, Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary, Efficiency of minimizing compositions of convex functions and smooth maps, Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity, Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization, Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization, Complexity and performance of an Augmented Lagrangian algorithm, Recent advances in trust region algorithms, High-Order Optimization Methods for Fully Composite Problems
