Log-exponential approximation in semi-infinite programming: a variational approach
From MaRDI portal
Cites work
- A barrier function method for minimax problems
- A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Algorithms with adaptive smoothing for finite minimax problems
- APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS
- Approximation procedures based on the method of multipliers
- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints
- Convergence of subdifferentials and normal cones in locally uniformly convex Banach space
- Convex analysis and nonlinear optimization. Theory and examples.
- Directionally Lipschitzian Functions and Subdifferential Calculus
- Duality in semi-infinite programs and some works of Haar and Carathéodory
- Epi-convergent smoothing with applications to convex composite functions
- Ergodic approach to robust optimization and infinite programming problems
- Formulae for the conjugate and the subdifferential of the supremum function
- Fundamentals of Convex Analysis and Optimization
- Gradient consistency for integral-convolution smoothing functions
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3634008 (Why is no real title available?)
- scientific article; zbMATH DE number 2068041 (Why is no real title available?)
- scientific article; zbMATH DE number 4119957 (Why is no real title available?)
- scientific article; zbMATH DE number 3893867 (Why is no real title available?)
- scientific article; zbMATH DE number 3263581 (Why is no real title available?)
- scientific article; zbMATH DE number 3325201 (Why is no real title available?)
- scientific article; zbMATH DE number 3336546 (Why is no real title available?)
- Moreau Envelope of Supremum Functions with Applications to Infinite and Stochastic Programming
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- On formulae for the Ioffe geometric subdifferential of a supremum function
- On the graph convergence of subdifferentials of convex functions
- On the subdifferential of an upper envelope of convex functions
- On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
- Optimality conditions in DC-constrained mathematical programming problems
- Penalty and smoothing methods for convex semi-infinite programming
- Semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Set-valued analysis
- Smooth minimization of non-smooth functions
- Smoothing methods for nonsmooth, nonconvex minimization
- Solving continuous min-max problems by an iterative entropic regularization method.
- Solving min-max problems and linear semi-infinite programs
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Subdifferential calculus using -subdifferentials
- Subdifferential formulae for the supremum of an arbitrary family of functions
- Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
- Über lineare Ungleichungen.
- Unilateral Variational Analysis in Banach Spaces
- Variational Analysis
- Variational analysis and applications
This page was built for publication: Log-exponential approximation in semi-infinite programming: a variational approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6963304)
