An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
type: Item
instance of: scholarly article
title: An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
zbMATH Open document ID: 1410.90169
author: Jian Lv
author: Li-Ping Pang
author: Na Xu
author: Ze-Hao Xiao
published in: Numerical Algorithms
publication date: 2019-02-07T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 93B40
zbMATH DE Number: 7015331
zbMATH Keywords: semi-infinite programming
zbMATH Keywords: constrained optimization
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: improvement function
zbMATH Keywords: bundle method
describes a project that uses: SolvOpt
MaRDI profile type: Publication
full work available at URL: s11075-018-0490-6
OpenAlex ID: W2791907626
cites work: Global solution of semi-infinite programs
cites work: Stability of indices in the KKT conditions and metric regularity in convex semi-infinite optimization
cites work: Q4375488
cites work: Convergence of some algorithms for convex minimization
cites work: Computation of the distance to semi-algebraic sets
cites work: Nonlinear programming without a penalty function.
cites work: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
cites work: A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
cites work: Q4357206
cites work: Globally convergent limited memory bundle method for large-scale nonsmooth optimization
cites work: Q5296449
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: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
cites work: Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
cites work: Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
cites work: Methods of descent for nondifferentiable optimization
cites work: An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
cites work: Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
cites work: A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
cites work: New variants of bundle methods
cites work: Semi-infinite programming
cites work: Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
cites work: Q4004158
cites work: A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
cites work: An Algorithm for Constrained Optimization with Semismooth Functions
cites work: A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
cites work: Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
cites work: A smoothing projected Newton-type algorithm for semi-infinite programming
cites work: Convex Analysis
cites work: Variational Analysis
cites work: On convex lower level problems in generalized semi-infinite optimization.
cites work: An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
cites work: On generalized semi-infinite optimization and bilevel optimization
cites work: Bi-level strategies in semi-infinite programming.
cites work: On constraint qualifications in nonsmooth optimization.
cites work: Discretization in semi-infinite programming: the rate of convergence
cites work: Computational discretization algorithms for functional inequality constrained optimization
cites work: A cutting-plane method for quadratic semi infinite programming problems
cites work: An iterative method for solving KKT system of the semi-infinite programming
cites work: Constrained nonconvex nonsmooth optimization via proximal bundle method
cites work: A New Exchange Method for Convex Semi-Infinite Programming
DOI: 10.1007/S11075-018-0490-6
description: scientific article; zbMATH DE number 7015331