A redistributed proximal bundle method for nonconvex optimization
From MaRDI portal
Publication:3083294
Recommendations
- A decomposition method with redistributed subroutine for constrained nonconvex optimization
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
Cited in
(74)- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
- Essentials of numerical nonsmooth optimization
- Composite proximal bundle method
- Improving an upper bound on the size of \(k\)-regular induced subgraphs
- A new trust region method for nonsmooth nonconvex optimization
- A redistributed bundle algorithm for generalized variational inequality problems in Hilbert spaces
- Cutting plane oracles to minimize non-smooth non-convex functions
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm
- Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm
- Aggregate subgradient method for nonsmooth DC optimization
- Optimal Convergence Rates for the Proximal Bundle Method
- Minimizing Piecewise-Concave Functions Over Polyhedra
- A reduced proximal-point homotopy method for large-scale non-convex BQP
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- Essentials of numerical nonsmooth optimization
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- A convergence analysis of the method of codifferential descent
- A proximal bundle method with exact penalty technique and bundle modification strategy for nonconvex nonsmooth constrained optimization
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Best practices for comparing optimization algorithms
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- scientific article; zbMATH DE number 7733428 (Why is no real title available?)
- Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
- Proximal bundle methods for nonsmooth DC programming
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- Computing proximal points of convex functions with inexact subgradients
- Derivative-free robust optimization by outer approximations
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- The chain rule for VU-decompositions of nonsmooth functions
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- Non-smooth optimization for robust control of infinite-dimensional systems
- Inexact proximal point methods in metric spaces
- Aggregate codifferential method for nonsmooth DC optimization
- Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
- Generalized order-value optimization
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- A Support Function Based Algorithm for Optimization with Eigenvalue Constraints
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- A proximal alternating linearization method for nonconvex optimization problems
- A version of bundle trust region method with linear programming
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Subgradient method for nonconvex nonsmooth optimization
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
- Weak convexity and approximate subdifferentials
- A splitting bundle approach for non-smooth non-convex minimization
- A decomposition method with redistributed subroutine for constrained nonconvex optimization
- Diagonal bundle method for nonsmooth sparse optimization
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
- A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective
- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- Bundle method for non-convex minimization with inexact subgradients and function values
- Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization
- Derivative-free optimization via proximal point methods
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- Long term dynamics of the subgradient method for Lipschitz path differentiable functions
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- A simple version of bundle method with linear programming
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
This page was built for publication: A redistributed proximal bundle method for nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083294)
