A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
From MaRDI portal
Publication:2129642
Recommendations
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- A bundle method for solving nonsmooth convex semi-infinite programming with inexact information
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
Cites work
- scientific article; zbMATH DE number 3870083 (Why is no real title available?)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A bundle-filter method for nonsmooth convex constrained optimization
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
- A new exchange method for convex semi-infinite programming
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A partially inexact bundle method for convex semi-infinite minmax problems
- 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
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- An approximate bundle method for solving nonsmooth equilibrium problems
- An implementation of a discretization method for semi-infinite programming
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- Approximate convexity and submonotonicity.
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Discretization in semi-infinite programming: the rate of convergence
- Feasible method for semi-infinite programs
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Global solution of semi-infinite programs
- Interval methods for semi-infinite programs
- Introduction to nonsmooth optimization. Theory, practice and software
- Relaxation-Based Bounds for Semi-Infinite Programs
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming
- Semismooth and Semiconvex Functions in Constrained Optimization
- Solving semi-infinite programs by smoothing projected gradient method
- Submonotone Subdifferentials of Lipschitz Functions
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
Cited in
(15)- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
- A new approach for nonconvex SIP
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
- Modified gradient sampling algorithm for nonsmooth semi-infinite programming
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- A stochastic approximation method for convex programming with many semidefinite constraints
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- A bundle method for solving nonsmooth convex semi-infinite programming with inexact information
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- A feasible point method with bundle modification for nonsmooth convex constrained optimization
This page was built for publication: A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129642)
