Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
From MaRDI portal
Publication:3608990
DOI10.1137/050623012zbMath1163.90024OpenAlexW2077008103WikidataQ58185777 ScholiaQ58185777MaRDI QIDQ3608990
Serge Gratton, Annick Sartenaer, Phillipe L. Toint
Publication date: 6 March 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050623012
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
An adaptive trust-region method without function evaluations, Newton-type multilevel optimization method, On a multilevel Levenberg–Marquardt method for the training of artificial neural networks and its application to the solution of partial differential equations, First-order geometric multilevel optimization for discrete tomography, A dual-weighted trust-region adaptive POD 4-D Var applied to a finite-volume shallow water equations model on the sphere, A Phase-Field Approach to Pneumatic Fracture, A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function, A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings, MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization, Improving Direct Search algorithms by multilevel optimization techniques, Coordinate search algorithms in multilevel optimization, An empirical study of derivative-free-optimization algorithms for targeted black-box attacks in deep neural networks, A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization, A recursive multilevel trust region method with application to fully monolithic phase-field models of brittle fracture, A detailed investigation of the model influencing parameters of the phase‐field fracture approach, On a global complexity bound of the Levenberg-marquardt method, Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training, Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization, Globally Convergent Multilevel Training of Deep Residual Networks, Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem, On the worst-case evaluation complexity of non-monotone line search algorithms, Adaptive multigrid strategy for geometry optimization of large-scale three dimensional molecular mechanics, Generalized Multilevel SQP-methods for PDAE-constrained Optimization Based on Space-Time Adaptive PDAE Solvers, A multilevel approach for nonnegative matrix factorization, A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems, Convergence analysis of the Fast Subspace Descent method for convex optimization problems, Using approximate secant equations in limited memory methods for multilevel unconstrained optimization, OFFO minimization algorithms for second-order optimality and their complexity, Newton-type methods for non-convex optimization under inexact Hessian information, The impact of noise on evaluation complexity: the deterministic trust-region case, A Multilevel Proximal Gradient Algorithm for a Class of Composite Optimization Problems, Approximating Hessians in unconstrained optimization arising from discretized problems, Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity, Complexity bounds for second-order optimality in unconstrained optimization, On the complexity of finding first-order critical points in constrained nonlinear optimization, An indicator for the switch from derivative-free to derivative-based optimization, A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis, On High-Order Multilevel Optimization Strategies, ARCq: a new adaptive regularization by cubics, Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality, Reconstructing local volatility using total variation, Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models, Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization, Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization, Properties of a class of multilevel optimization algorithms for equality-constrained problems, A Newton-like trust region method for large-scale unconstrained nonconvex minimization, An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity, Worst-case complexity bounds of directional direct-search methods for multiobjective optimization, Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization, A generalized worst-case complexity analysis for non-monotone line searches, Worst case complexity of direct search under convexity, Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization, A second-order globally convergent direct-search method and its worst-case complexity, A regularized Newton method without line search for unconstrained optimization, Worst case complexity of direct search, Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints, On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization, A first-order multigrid method for bound-constrained convex optimization, Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case, Modeling, Simulation and Optimization of Radio Frequency Ablation, Subdivision-Based Nonlinear Multiscale Cloth Simulation, Riemannian Multigrid Line Search for Low-Rank Problems, Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization, Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary, Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization, Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization, On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods, Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method, Recent advances in trust region algorithms, Accelerated gradient methods for nonconvex nonlinear and stochastic programming
