Pages that link to "Item:Q3696877"

The following pages link to Conditions for convergence of trust region algorithms for nonsmooth optimization (Q3696877):

Displaying 48 items.

• Nonsmooth bundle trust-region algorithm with applications to robust stability (Q255187) (← links)
• A proximal method for composite minimization (Q304260) (← links)
• A trust region algorithm for solving bilevel programming problems (Q385180) (← links)
• On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization (Q494338) (← links)
• Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization'' (Q507344) (← links)
• Constructing composite search directions with parameters in quadratic interpolation models (Q652677) (← links)
• Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
• Canonical duality for solving nonconvex and nonsmooth optimization problem (Q833455) (← links)
• A new filter method for solving nonlinear complementarity problems (Q870225) (← links)
• Global convergence of a semi-infinite optimization method (Q912572) (← links)
• Two error bounds for constrained optimization problems and their applications (Q1021250) (← links)
• Experiments with successive quadratic programming algorithms (Q1090233) (← links)
• A trust region algorithm for equality constrained optimization (Q1174456) (← links)
• A trust region algorithm for minimization of locally Lipschitzian functions (Q1338134) (← links)
• A trust region algorithm for nonsmooth optimization (Q1341571) (← links)
• A trust region method for minimization of nonsmooth functions with linear constraints (Q1356054) (← links)
• Iteration functions in some nonsmooth optimization algorithms (Q1363553) (← links)
• Trust region algorithm for nonsmooth optimization (Q1366819) (← links)
• Quasi-Newton trust region algorithm for non-smooth least squares problems (Q1569085) (← links)
• Canonical duality for box constrained nonconvex and nonsmooth optimization problems (Q1665441) (← links)
• Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions (Q1772966) (← links)
• An inexact algorithm for composite nondifferentiable optimization (Q1823153) (← links)
• Nonmonotone trust region method for solving optimization problems (Q1886565) (← links)
• Unification of basic and composite nondifferentiable optimization (Q1924063) (← links)
• A derivative-free trust-region algorithm for composite nonsmooth optimization (Q2013620) (← links)
• An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity (Q2020598) (← links)
• Recent advances in trust region algorithms (Q2349124) (← links)
• Direct search based on probabilistic feasible descent for bound and linearly constrained problems (Q2419520) (← links)
• Value functions and error bounds of trust region methods (Q2454979) (← links)
• Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs (Q2565034) (← links)
• Two globally convergent nonmonotone trust-region methods for unconstrained optimization (Q2634354) (← links)
• On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications (Q2810547) (← 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 new trust region method for nonsmooth nonconvex optimization (Q3177633) (← links)
• Global convergence of a filter-trust-region algorithm for solving nonsmooth equations (Q3568420) (← links)
• A new trust region method for nonsmooth equations (Q4430644) (← links)
• Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components (Q4554066) (← links)
• A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints (Q4637499) (← links)
• A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization (Q5081096) (← links)
• Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
• Computation of second-order directional stationary points for group sparse optimization (Q5210743) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods (Q5253577) (← links)
• Manifold Sampling for $\ell_1$ Nonconvex Optimization (Q5506685) (← links)
• A Trust-region Method for Nonsmooth Nonconvex Optimization (Q5881403) (← links)
• Efficiency of higher-order algorithms for minimizing composite functions (Q6155068) (← links)
• A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations (Q6165597) (← links)