A bundle trust-region algorithm for nonsmooth nonconvex constrained optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 3619635 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A bundle-Newton method for nonsmooth unconstrained minimization
- A bundle-filter method for nonsmooth convex constrained optimization
- A computational comparison of some non-linear programs
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A new trust region method for nonsmooth nonconvex optimization
- A proximal bundle algorithm for nonsmooth optimization on Riemannian manifolds
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
- A redistributed proximal bundle method for nonconvex optimization
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- A trust region algorithm for minimization of locally Lipschitzian functions
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- An aggregate subgradient method for nonsmooth convex minimization
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- Approximate convexity and submonotonicity.
- Benchmarking optimization software with performance profiles.
- Bundle method for nonconvex nonsmooth constrained optimization
- Computing proximal points of nonconvex functions
- Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
- Cutting plane oracles to minimize non-smooth non-convex functions
- Design of a flight control architecture using a non-convex bundle method
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Level bundle methods for oracles with on-demand accuracy
- New variants of bundle methods
- Non-smooth optimization for robust control of infinite-dimensional systems
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Optimization and nonsmooth analysis
- Proximal Methods in Vector Optimization
- Proximal bundle methods for nonsmooth DC programming
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Submonotone Subdifferentials of Lipschitz Functions
- Trust Region Methods
This page was built for publication: A bundle trust-region algorithm for nonsmooth nonconvex constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907539)
