A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
type: Item
instance of: scholarly article
title: A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
zbMATH Open document ID: 1425.90084
author: Najmeh Hoseini Monjezi
author: S. Nobakhtian
published in: Computational Optimization and Applications
publication date: 2019-11-22T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7135241
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: constrained programming
zbMATH Keywords: proximal bundle method
zbMATH Keywords: improvement function
zbMATH Keywords: infeasible algorithm
describes a project that uses: Matlab
describes a project that uses: SLQP-GS
MaRDI profile type: Publication
full work available at URL: s10589-019-00115-8
OpenAlex ID: W2952730435
cites work: A computational comparison of some non-linear programs
cites work: Best practices for comparing optimization algorithms
cites work: Q4375488
cites work: Convergence of some algorithms for convex minimization
cites work: A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
cites work: Approximate convexity and submonotonicity.
cites work: Bundle method for nonconvex nonsmooth constrained optimization
cites work: Nonconvex bundle method with application to a delamination problem
cites work: Benchmarking optimization software with performance profiles.
cites work: Design of a flight control architecture using a non-convex bundle method
cites work: Computing proximal points of nonconvex functions
cites work: A Redistributed Proximal Bundle Method for Nonconvex Optimization
cites work: A proximal bundle method for nonsmooth nonconvex functions with inexact information
cites work: A proximal bundle method based on approximate subgradients
cites work: Q4273942
cites work: A new trust region method for nonsmooth nonconvex optimization
cites work: A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
cites work: A bundle-filter method for nonsmooth convex constrained optimization
cites work: A Linearization Algorithm for Nonsmooth Minimization
cites work: Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
cites work: Q4182270
cites work: Q4735938
cites work: A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
cites work: An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
cites work: Q4004158
cites work: A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Cutting plane oracles to minimize non-smooth non-convex functions
cites work: Variational Analysis
cites work: An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
cites work: An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
cites work: Q5187067
cites work: Submonotone Subdifferentials of Lipschitz Functions
cites work: A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
cites work: Constrained nonconvex nonsmooth optimization via proximal bundle method
Wikidata QID: Q127650235
DOI: 10.1007/S10589-019-00115-8
description: scientific article; zbMATH DE number 7135241