Strong and Weak Convexity of Sets and Functions
From MaRDI portal
Publication:3040937
Cited in
(only showing first 100 items - show all)- Local differentiability of distance functions
- Vector variational inequality as a tool for studying vector optimization problems
- Direct proofs of intrinsic properties of prox-regular sets in Hilbert spaces
- Characterization of convexifiable functions
- Nonconvex Robust Low-Rank Matrix Recovery
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
- scientific article; zbMATH DE number 7288685 (Why is no real title available?)
- Determination of sets with positive reach by their projection type images
- Duality for nondifferentiable multiobjective higher-order symmetric programs over cones involving generalized \((F,{\alpha},{\rho},d)\)-convexity
- The external estimate of the compact set by Lebesgue set of the convex function
- Higher order duality for cone vector optimization problems
- Properties of the distance function to strongly and weakly convex sets in a nonsymmetrical space
- Viscous approximations of non-convex sweeping processes in the space of regulated functions
- Convergent algorithm based on progressive regularization for solving pseudomonotone variational inequalities
- Spherical shell of the boundary of a compact set with a minimum cross-sectional area formed by a two-dimensional plane
- Strong subdifferentials: theory and applications in nonconvex optimization
- Prox-regular functions in variational analysis
- Optimality conditions and duality of three kinds of nonlinear fractional programming problems
- Set-valued fractional programming problems under generalized cone convexity
- Relaxed-inertial proximal point type algorithms for quasiconvex minimization
- Distance between strongly and weakly convex sets
- Subdifferentiation of regularized functions
- Efficiency and generalized convex duality for multiobjective programs
- What is quasiconvex analysis?
- A separation theorem for nonconvex sets and its applications
- Higher order duality in multiobjective fractional programming problem with generalized convexity
- Prox-regular sets and Legendre-Fenchel transform related to separation properties
- The gradient projection method for a supporting function on the unit sphere and its applications
- scientific article; zbMATH DE number 6927777 (Why is no real title available?)
- Sufficiency and Duality in Multiobjective Programming with Generalized (F, ρ)-Convexity
- Multiobjective programming under (,d)-V-type I univexity
- Generalized \((F,\rho )\)-convexity and duality in nonsmooth problems of multiobjective optimization
- Well-posedness of approximation and optimization problems for weakly convex sets and functions
- On generalized convexity and duality with a square root term
- Hermite-Hadamard type inequalities for Riemann-Liouville fractional integrals via strongly h-convex functions
- Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
- Proper efficiency and generalized nonconvex duality for vector minimization problems
- Explicit and implicit non-convex sweeping processes in the space of absolutely continuous functions
- Optimality and duality theorems in nonsmooth multiobjective optimization
- On semi-infinite minmax programming with generalized invexity
- Continuity of the non-convex play operator in the space of rectifiable curves.
- Duality for composite optimization problem within the framework of abstract convexity
- Some Hermite–Hadamard type inequalities for GA‐s‐convex functions in the fourth sense
- Statistical Finite Elements via Langevin Dynamics
- Primal-lower-nice property of value functions in optimization and control problems
- About the Lipschitz property of the metric projection in the Hilbert space
- Endogenous cycles with small discounting in multisector optimal growth models: Continuous-time case
- Metric projection and compatibly parameterized families of prox-regular sets in Hilbert space
- Optimization methods for mixed integer weakly concave programming problems
- Sufficient conditions for a minimum of a strongly quasiconvex function on a weakly convex set
- Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds
- Uniform prox-regularity of functions and epigraphs in Hilbert spaces
- Dynamic complexity of optimal paths and discount factors for strongly concave problems
- Sufficiency criteria and duality for nonlinear programs involving n-set functions
- Endogenous cycles in discrete symmetric multisector optimal growth models
- ENVELOPES FOR SETS AND FUNCTIONS: REGULARIZATION AND GENERALIZED CONJUGACY
- On relations and applications of generalized second-order directional derivatives
- On minimax fractional optimality conditions with \((F,\rho)\)-convexity
- Linearly constrained global minimization of functions with concave minorants
- Approximately convex functions and approximately monotonic operators
- Area theorem and smoothness of compact Cauchy horizons
- Optimality conditions for maximizing a locally Lipschitz function
- New metric properties for prox-regular sets
- Sufficient global optimality conditions for weakly convex minimization problems
- Extremal problems in geometric function theory
- Generalised hessian, max function and weak convexity
- Efficiency and generalized convex duality for nondifferentiable multiobjective programs
- Asymptotical well behaviour for constrained minimisation problems
- Cyclic hypomonotonicity, cyclic submonotonicity, and integration
- Stationary equilibria in discounted stochastic games with weakly interacting players
- Duality for nondifferentiable minimax fractional programming problem involving higher order \((C,\alpha, \rho, d)\)-convexity
- Generalized convexities and generalized gradients based on algebraic operations
- On efficiency and duality for multiobjective programs
- Proximal point algorithms for quasiconvex pseudomonotone equilibrium problems
- Approximate convexity and submonotonicity.
- Characterization of nonsmooth functions through their generalized gradients
- Farthest distance function to strongly convex sets
- The Glowinski-Le Tallec splitting method revisited in the framework of equilibrium problems in Hilbert spaces
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem
- Global optimality conditions for some classes of optimization problems
- Saddle point criteria in semi-infinite minimax fractional programming under \((\Phi,\rho)\)-invexity
- Uniformly convex and uniformly smooth convex functions
- On higher-order duality in nondifferentiable minimax fractional programming
- Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
- Sufficiency and duality in nonsmooth multiobjective programming problem under generalized univex functions
- The Lipschitz property of the metric projection in the Hilbert space
- Subvexormal functions and subvex functions
- The gradient projection algorithm for smooth sets and functions in nonconvex case
- Duality for nondifferentiable static multiobjective variational problems involving generalized \((F,\rho)\)-convex functions
- Non-convex sweeping processes in the space of regulated functions
- A geometric analysis of Renegar's condition number, and its interplay with conic curvature
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- Strongly convex set-valued maps
- A sandwich theorem for generalized convexity and applications
- Conical averagedness and convergence analysis of fixed point algorithms
- First and Second Order Duality for a class of Nondifferentiable Fractional Programming Problem
- Helping you finding an appropriate regularization process
- An extension of the proximal point algorithm beyond convexity
This page was built for publication: Strong and Weak Convexity of Sets and Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3040937)
