Pages that link to "Item:Q3083294"
From MaRDI portal
The following pages link to A Redistributed Proximal Bundle Method for Nonconvex Optimization (Q3083294):
Displaying 50 items.
- Nonsmooth bundle trust-region algorithm with applications to robust stability (Q255187) (← links)
- Subgradient method for nonconvex nonsmooth optimization (Q353174) (← links)
- Composite proximal bundle method (Q359623) (← links)
- Improving an upper bound on the size of \(k\)-regular induced subgraphs (Q411262) (← links)
- Constrained nonconvex nonsmooth optimization via proximal bundle method (Q481058) (← links)
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- Cutting plane oracles to minimize non-smooth non-convex functions (Q618887) (← links)
- Inexact proximal point methods in metric spaces (Q763334) (← links)
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems (Q824547) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Non-smooth optimization for robust control of infinite-dimensional systems (Q1653334) (← links)
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1665008) (← links)
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
- A convergence analysis of the method of codifferential descent (Q1756589) (← links)
- Generalized order-value optimization (Q1935880) (← links)
- A decomposition method with redistributed subroutine for constrained nonconvex optimization (Q1949452) (← links)
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming (Q1983659) (← links)
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← links)
- Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
- Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions (Q2013149) (← links)
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information (Q2031374) (← links)
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data (Q2066220) (← links)
- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization (Q2104108) (← links)
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← links)
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems (Q2136887) (← links)
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems (Q2150773) (← links)
- Derivative-free optimization via proximal point methods (Q2250069) (← links)
- Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
- Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity (Q2281266) (← links)
- Derivative-free robust optimization by outer approximations (Q2288189) (← links)
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256) (← links)
- Aggregate codifferential method for nonsmooth DC optimization (Q2349678) (← links)
- Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
- A simple version of bundle method with linear programming (Q2419511) (← links)
- A proximal alternating linearization method for nonconvex optimization problems (Q2926053) (← links)
- A Support Function Based Algorithm for Optimization with Eigenvalue Constraints (Q2967609) (← links)
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
- A new trust region method for nonsmooth nonconvex optimization (Q3177633) (← links)
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization (Q4622889) (← links)
- A sharp augmented Lagrangian-based method in constrained non-convex optimization (Q4631763) (← links)
- A Redistributed Bundle Algorithm for Generalized Variational Inequality Problems in Hilbert Spaces (Q4689377) (← links)
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization (Q5058177) (← links)
- Adaptive Bundle Methods for Nonlinear Robust Optimization (Q5106409) (← links)
- The chain rule for VU-decompositions of nonsmooth functions (Q5110185) (← links)
- A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities (Q5116553) (← links)
- Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space (Q5193505) (← links)
