Approximate optimality conditions and mixed type duality for a class of non-convex optimization problems
zbMATH Open1524.49066MaRDI QIDQ6155210FDOQ6155210
Authors: Jiaolang Wang, D. H. Fang 
Publication date: 12 June 2023
Full work available at URL: http://121.43.60.238/sxwlxbA/EN/abstract/abstract16688.shtml
Recommendations
- Approximate optimality conditions and mixed type duality for quasiconvex optimization problems
- Approximate optimality conditions and mixed type duality for composite convex optimization problems
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- Refinements of \(\varepsilon\)-duality theorems for a nonconvex problem with an infinite number of constraints
constraint qualificationmixed type dualityapproximate optimality conditionsnon-convex constraint optimization problem
Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Duality theory (optimization) (49N15)
Cites Work
- Title not available (Why is that?)
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data
- ε-Subdifferential and ε-monotonicity
- On Minty variational principle for nonsmooth vector optimization problems with approximate convexity
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Nonsmooth semi-infinite multiobjective optimization problems
- New Farkas-type constraint qualifications in convex infinite programming
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Wolfe duality and Mond-Weir duality via perturbations
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- On quasi \(\epsilon\)-solution for robust convex optimization problems
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- Optimality conditions in convex optimization revisited
- On representations of the feasible set in convex optimization
- Optimality conditions for convex semi-infinite programming problems
- Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
- Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications
- \( \epsilon \)-optimality conditions and \(\epsilon \)-saddle point theorems for robust conical programming problems
- Obituary
Cited In (1)
This page was built for publication: Approximate optimality conditions and mixed type duality for a class of non-convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155210)
