Pages that link to "Item:Q2841063"

The following pages link to Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization (Q2841063):

Displaying 20 items.

• A smoothing trust region filter algorithm for nonsmooth least squares problems (Q295140) (← links)
• A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
• A note on the smoothing quadratic regularization method for non-Lipschitz optimization (Q494677) (← links)
• Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
• Worst case complexity of direct search (Q743632) (← links)
• A derivative-free trust-region algorithm for composite nonsmooth optimization (Q2013620) (← links)
• Worst-case complexity bounds of directional direct-search methods for multiobjective optimization (Q2026717) (← links)
• Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials (Q2230937) (← links)
• Steklov regularization and trajectory methods for univariate global optimization (Q2301181) (← links)
• Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization (Q2374365) (← links)
• Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043) (← links)
• A second-order globally convergent direct-search method and its worst-case complexity (Q2810113) (← links)
• Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case (Q2826817) (← links)
• Penalty methods with stochastic approximation for stochastic nonlinear programming (Q2970100) (← links)
• A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization (Q3174787) (← links)
• A derivative-free comirror algorithm for convex optimization (Q3458813) (← links)
• Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods (Q4634094) (← links)
• A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization (Q5085238) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• Worst case complexity of direct search under convexity (Q5962720) (← links)