Approximate optimality conditions and mixed type duality for a class of non-convex optimization problems

MaRDI QIDQ6155210zbMATH OpenFDO

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

zbMATH Keywords

constraint qualificationmixed type dualityapproximate optimality conditionsnon-convex constraint optimization problem

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Duality theory (optimization) (49N15)

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

Cites work

• scientific article; zbMATH DE number 1807400 (Why is no real title available?)
• Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
• Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
• Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
• New Farkas-type constraint qualifications in convex infinite programming
• Nonsmooth semi-infinite multiobjective optimization problems
• Obituary
• On Minty variational principle for nonsmooth vector optimization problems with approximate convexity
• On -solutions for convex optimization problems with uncertainty data
• On quasi \(\epsilon\)-solution for robust convex optimization problems
• On representations of the feasible set in convex optimization
• Optimality conditions for convex semi-infinite programming problems
• Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications
• Optimality conditions in convex optimization revisited
• Wolfe duality and Mond-Weir duality via perturbations
• \( \epsilon \)-optimality conditions and \(\epsilon \)-saddle point theorems for robust conical programming problems
• \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
• ε-Subdifferential and ε-monotonicity

Cited in

(1)

• Approximate optimality conditions and mixed type duality for quasiconvex optimization problems

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)