A filter proximal bundle method for nonsmooth nonconvex constrained optimization
From MaRDI portal
Publication:2022218
DOI10.1007/s10898-020-00939-3zbMath1465.90073OpenAlexW3048660030MaRDI QIDQ2022218
Najmeh Hoseini Monjezi, Soghra Nobakhtian
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00939-3
global convergencenonsmooth optimizationnonconvex optimizationproximal bundle methodfilter technique
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)
Related Items
A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions ⋮ A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems ⋮ An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems ⋮ New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information ⋮ Optimal Convergence Rates for the Proximal Bundle Method ⋮ Global optimization for non-convex programs via convex proximal point method ⋮ A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subgradient method for nonconvex nonsmooth optimization
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Cutting plane oracles to minimize non-smooth non-convex functions
- Computing proximal points of nonconvex functions
- A bundle-filter method for nonsmooth convex constrained optimization
- A filter-variable-metric method for nonsmooth convex constrained optimization
- Convergence of some algorithms for convex minimization
- Approximate convexity and submonotonicity.
- Best practices for comparing optimization algorithms
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- Methods of descent for nondifferentiable optimization
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- A new trust region method for nonsmooth nonconvex optimization
- Global Convergence of Filter Methods for Nonlinear Programming
- Optimization and nonsmooth analysis
- Submonotone Subdifferentials of Lipschitz Functions
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- A Globally Convergent Filter Method for Nonlinear Programming
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- A computational comparison of some non-linear programs
- Benchmarking optimization software with performance profiles.
- Nonlinear programming without a penalty function.
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
This page was built for publication: A filter proximal bundle method for nonsmooth nonconvex constrained optimization
