Approximate optimality conditions and sensitivity analysis in nearly convex optimization
DOI10.1007/S11117-024-01103-XMaRDI QIDQ6665564
Vu Hong Quan, Liguo Jiao, Duong Thi Viet An, Nguyen Van Tuyen
Publication date: 17 January 2025
Published in: Positivity (Search for Journal in Brave)
optimal value functionrelative interiorapproximate optimality conditionsapproximate subdifferentialnear convexity
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions
- Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings
- On the maximal domain of a monotone function
- Fenchel's duality theorem for nearly convex functions
- Subgradients of marginal functions in parametric mathematical programming
- Intersection formulae and the marginal function in Banach spaces
- Differential stability of convex optimization problems with possibly empty solution sets
- On the virtual convexity of the domain and range of a nonlinear maximal monotone operator
- Sensitivity Analysis of Optimal Value Functions of Convex Parametric Programs with Possibly Empty Solution Sets
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- On AKKT optimality conditions for cone-constrained vector optimization problems
- Differential stability of convex optimization problems under inclusion constraints
- Differential stability of convex optimization problems under weaker conditions
- On the Subdifferentiability of Convex Functions
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
This page was built for publication: Approximate optimality conditions and sensitivity analysis in nearly convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665564)
