A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
From MaRDI portal
Publication:2104108
Recommendations
- A proximal bundle method with exact penalty technique and bundle modification strategy for nonconvex nonsmooth constrained optimization
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- A proximal bundle-filter algorithm for a class of nonconvex nonsmooth constrained optimization problem
Cites work
- A bundle-filter method for nonsmooth convex constrained optimization
- A feasible point method with bundle modification for nonsmooth convex constrained optimization
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A redistributed proximal bundle method for nonconvex optimization
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Approximate convexity and submonotonicity.
- Benchmarking optimization software with performance profiles.
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- Generalized monotone line search SQP algorithm for constrained minimax problems
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- Identifying structure of nonsmooth convex functions by the bundle technique
- Inexact bundle methods for two-stage stochastic programming
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Submonotone Subdifferentials of Lipschitz Functions
- Variational Analysis
Cited in
(7)- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- A proximal bundle method with exact penalty technique and bundle modification strategy for nonconvex nonsmooth constrained optimization
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
- An inexact bundle method for semi-infinite minimax problems
- A proximal bundle technique for solving the equilibrium problems with inexact oracles
This page was built for publication: A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104108)
