A new trust region method for nonsmooth nonconvex optimization
From MaRDI portal
(Redirected from Publication:3177633)
Recommendations
Cites work
- scientific article; zbMATH DE number 3868525 (Why is no real title available?)
- scientific article; zbMATH DE number 3934328 (Why is no real title available?)
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 3503002 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 888764 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- A BFGS trust-region method for nonlinear equations
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A model algorithm for composite nondifferentiable optimization problems
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- A quasisecant method for minimizing nonsmooth functions
- A redistributed proximal bundle method for nonconvex optimization
- A trust region algorithm for minimization of locally Lipschitzian functions
- A unified approach to global convergence of trust region methods for nonsmooth optimization
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- An algorithm for solving linearly constrained optimization problems
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- Generalized Bundle Methods
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Numerical Optimization
- On the global convergence of trust region algorithms for unconstrained minimization
- Optimization and nonsmooth analysis
- Optimization of lipschitz continuous functions
- Subgradient method for nonconvex nonsmooth optimization
- Survey of Bundle Methods for Nonsmooth Optimization
- Trust Region Methods
Cited in
(17)- Trust-region methods for the derivative-free optimization of nonsmooth black-box functions
- Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm
- Bundle trust region algorithm based on linear subproblem
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- A trust region method for nonsmooth convex optimization
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- scientific article; zbMATH DE number 847817 (Why is no real title available?)
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
- A new trust region algorithm for nonsmooth convex minimization
- A structured trust region method for nonconvex programming with separable structure
- A bundle trust-region algorithm for nonsmooth nonconvex constrained optimization
- A dynamic multiple proximal bundle algorithm for locally Lipschitz multiobjective optimization problems
- A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
This page was built for publication: A new trust region method for nonsmooth nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177633)
