An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
From MaRDI portal
Publication:1717575
DOI10.1007/s11075-018-0490-6zbMath1410.90169OpenAlexW2791907626MaRDI QIDQ1717575
Li-Ping Pang, Jian Lv, Na Xu, Ze-Hao Xiao
Publication date: 7 February 2019
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-018-0490-6
nonsmooth optimizationconstrained optimizationnonconvex optimizationsemi-infinite programmingbundle methodimprovement function
Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Semi-infinite programming (90C34)
Related Items
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ A multi-step doubly stabilized bundle method for nonsmooth convex optimization ⋮ New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Optimal Convergence Rates for the Proximal Bundle Method ⋮ A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems ⋮ A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods ⋮ A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization ⋮ A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions ⋮ An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information ⋮ A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data ⋮ A new restricted memory level bundle method for constrained convex nonsmooth optimization ⋮ A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- On constraint qualifications in nonsmooth optimization.
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Semi-infinite programming
- Computing proximal points of nonconvex functions
- A smoothing projected Newton-type algorithm for semi-infinite programming
- Stability of indices in the KKT conditions and metric regularity in convex semi-infinite optimization
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Convergence of some algorithms for convex minimization
- Bi-level strategies in semi-infinite programming.
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- Global solution of semi-infinite programs
- On generalized semi-infinite optimization and bilevel optimization
- New variants of bundle methods
- Methods of descent for nondifferentiable optimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- A New Exchange Method for Convex Semi-Infinite Programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
- An iterative method for solving KKT system of the semi-infinite programming
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- A cutting-plane method for quadratic semi infinite programming problems
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An Algorithm for Constrained Optimization with Semismooth Functions
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- Variational Analysis
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Computation of the distance to semi-algebraic sets
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming
- Convex Analysis
- Computational discretization algorithms for functional inequality constrained optimization
- Discretization in semi-infinite programming: the rate of convergence
- Nonlinear programming without a penalty function.
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
