Smoothing by mollifiers. I: Semi-infinite optimization
From MaRDI portal
Publication:934789
DOI10.1007/s10898-007-9232-3zbMath1166.90017OpenAlexW2071920504MaRDI QIDQ934789
Oliver Stein, Hubertus Th. Jongen
Publication date: 30 July 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9232-3
Smooth approximations in differential topology (57R12) Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34)
Related Items
Constrained Consensus-Based Optimization ⋮ Unnamed Item ⋮ Smoothing by mollifiers. II: Nonlinear optimization ⋮ Gradient consistency for integral-convolution smoothing functions ⋮ Epi-convergence properties of smoothing by infimal convolution ⋮ How to solve a semi-infinite optimization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On absorbing cycles in min-max digraphs
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- On constraint qualifications in nonsmooth optimization.
- Smoothing by mollifiers. II: Nonlinear optimization
- Semi-infinite optimization: Structure and stability of the feasible set
- Optimization. Algorithms and consistent approximations
- A path following algorithm for infinite quadratic programming on a Hilbert space
- An approximation of feasible sets in semi-infinite optimization.
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Definitheitsbedingungen für relative Extrema bei Optimierungs- und Approximationsaufgaben
- Proximal interior point method for convex semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Critical sets in parametric optimization
- On stability and stationary points in nonlinear optimization
- Generalized Gradients and Applications
- On sufficient conditions for local optimality in semi-infinite programming
- The Minimization of Semicontinuous Functions: Mollifier Subgradients
- Point-to-Set Maps in Mathematical Programming
- On logarithmic smoothing of the maximum function
