A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 16626
- Bundle method for nonconvex nonsmooth constrained optimization
- An implementable bundle method for nonsmooth convex optimization
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- A hybrid bundle method for nonsmooth convex optimization
- A bundle-Newton method for nonsmooth unconstrained minimization
- scientific article; zbMATH DE number 1584097
- Nonmonotone bundle-type scheme for convex nonsmooth minimization
- An approximate bundle method for non-convex optimization and its dual problem
- scientific article; zbMATH DE number 764394
Cited in
(31)- Nonmonotone bundle-type scheme for convex nonsmooth minimization
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- Target radius methods for nonsmooth convex optimization
- An incremental bundle method for portfolio selection problem under second-order stochastic dominance
- Computing proximal points of convex functions with inexact subgradients
- A simple version of bundle method with linear programming
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
- A primal nonsmooth reformulation for bilevel optimization problems
- An online convex optimization-based framework for convex bilevel optimization
- An approximate bundle method for non-convex optimization and its dual problem
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- An algorithm using trust region strategy for minimization of a nondifferentiable function
- scientific article; zbMATH DE number 1322063 (Why is no real title available?)
- Algorithms for simple bilevel programming
- Bilevel optimization: theory, algorithms, applications and a bibliography
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- A splitting bundle approach for non-smooth non-convex minimization
- scientific article; zbMATH DE number 2201296 (Why is no real title available?)
- New constraint qualifications for S-stationarity for MPEC with nonsmooth objective
- Implicit solution function of P\(_{0}\) and Z matrix linear complementarity constraints
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function
- Focus programming: a bi‐level programming approach to static stochastic optimization problems
- A version of bundle trust region method with linear programming
- Algorithmic schemes for non-smooth simple bilevel programming problem and simple MPEC problem
- An inexact spectral bundle method for convex quadratic semidefinite programming
- Bundle trust region algorithm based on linear subproblem
- Improved guarantees for optimal Nash equilibrium seeking and bilevel variational inequalities
- On the convergence of proximal gradient methods for convex simple bilevel optimization
- A review of recent advances in global optimization
- New filled functions for nonsmooth global optimization
This page was built for publication: A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5444290)
