Pages that link to "Item:Q3608990"

The following pages link to Recursive Trust-Region Methods for Multiscale Nonlinear Optimization (Q3608990):

Displaying 50 items.

• Accelerated gradient methods for nonconvex nonlinear and stochastic programming (Q263185) (← links)
• A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings (Q316165) (← links)
• Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem (Q415364) (← links)
• Using approximate secant equations in limited memory methods for multilevel unconstrained optimization (Q429494) (← links)
• Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality (Q504812) (← links)
• Reconstructing local volatility using total variation (Q523719) (← links)
• Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models (Q526842) (← links)
• On a global complexity bound of the Levenberg-marquardt method (Q620432) (← links)
• Approximating Hessians in unconstrained optimization arising from discretized problems (Q645548) (← links)
• Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity (Q652287) (← links)
• Complexity bounds for second-order optimality in unconstrained optimization (Q657654) (← links)
• A regularized Newton method without line search for unconstrained optimization (Q742310) (← links)
• Worst case complexity of direct search (Q743632) (← links)
• First-order geometric multilevel optimization for discrete tomography (Q826166) (← links)
• On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392) (← links)
• An indicator for the switch from derivative-free to derivative-based optimization (Q1728260) (← links)
• A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis (Q1730832) (← links)
• Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
• Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208) (← links)
• A Newton-like trust region method for large-scale unconstrained nonconvex minimization (Q2015579) (← links)
• An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity (Q2020598) (← links)
• Worst-case complexity bounds of directional direct-search methods for multiobjective optimization (Q2026717) (← links)
• A generalized worst-case complexity analysis for non-monotone line searches (Q2028039) (← links)
• An adaptive trust-region method without function evaluations (Q2125064) (← links)
• An empirical study of derivative-free-optimization algorithms for targeted black-box attacks in deep neural networks (Q2168625) (← links)
• A recursive multilevel trust region method with application to fully monolithic phase-field models of brittle fracture (Q2175275) (← links)
• Newton-type methods for non-convex optimization under inexact Hessian information (Q2205970) (← links)
• Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
• Recent advances in trust region algorithms (Q2349124) (← links)
• A multilevel approach for nonnegative matrix factorization (Q2428091) (← links)
• On the complexity of finding first-order critical points in constrained nonlinear optimization (Q2452373) (← links)
• Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043) (← links)
• OFFO minimization algorithms for second-order optimality and their complexity (Q2696918) (← links)
• The impact of noise on evaluation complexity: the deterministic trust-region case (Q2696963) (← links)
• A second-order globally convergent direct-search method and its worst-case complexity (Q2810113) (← links)
• On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization (Q2815548) (← links)
• A first-order multigrid method for bound-constrained convex optimization (Q2815552) (← links)
• Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case (Q2826817) (← links)
• A dual-weighted trust-region adaptive POD 4-D Var applied to a finite-volume shallow water equations model on the sphere (Q2893575) (← links)
• Coordinate search algorithms in multilevel optimization (Q2926068) (← links)
• Generalized Multilevel SQP-methods for PDAE-constrained Optimization Based on Space-Time Adaptive PDAE Solvers (Q2961053) (← links)
• Modeling, Simulation and Optimization of Radio Frequency Ablation (Q2961082) (← links)
• MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization (Q3179624) (← links)
• Improving Direct Search algorithms by multilevel optimization techniques (Q3458830) (← links)
• A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems (Q4600837) (← links)
• ARC_q: a new adaptive regularization by cubics (Q4638924) (← links)
• Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization (Q4924105) (← links)
• Riemannian Multigrid Line Search for Low-Rank Problems (Q4997383) (← links)
• Newton-type multilevel optimization method (Q5038170) (← links)
• On a multilevel Levenberg–Marquardt method for the training of artificial neural networks and its application to the solution of partial differential equations (Q5038185) (← links)