Approximate solutions to nonsmooth multiobjective programming problems

MaRDI QIDQ5074081zbMATH OpenFDO

Authors M. Golestani

Publication date 6 May 2022

Full work available at URL https://www.heldermann.de/MTA/MTA07/MTA071/mta07005.htm

zbMATH Keywords

mathematical programmingnonlinear programmingoptimality conditionsnonsmooth analysis and approximate conditions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Recommendations

• An approximate strong KKT condition for multiobjective optimization
• A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization
• Approximate Karush-Kuhn-Tucker condition in multiobjective optimization
• Optimality conditions for efficiency on nonsmooth multiobjective programming problems
• scientific article; zbMATH DE number 751236

Cites work

• scientific article; zbMATH DE number 46303 (Why is no real title available?)
• scientific article; zbMATH DE number 46305 (Why is no real title available?)
• scientific article; zbMATH DE number 3354101 (Why is no real title available?)
• A cone-continuity constraint qualification and algorithmic consequences
• A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization
• An approximate strong KKT condition for multiobjective optimization
• Approximate Karush-Kuhn-Tucker condition in multiobjective optimization
• Efficiency in multiple objective optimization problems
• Generalized convexity, nonsmooth variational inequalities, and nonsmooth optimization
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
• Nonlinear Programming
• Nonsmooth analysis
• Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions
• On sequential optimality conditions for smooth constrained optimization
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• Practical augmented Lagrangian methods for constrained optimization
• Regularity conditions in vector optimization
• Variational Analysis
• \(\epsilon\)-solutions in vector minimization problems

Cited in

(6)

• An approximate strong KKT condition for multiobjective optimization
• Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems
• Approximating the nondominated set of an MOLP by approximately solving its dual problem
• A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization
• Approximate Karush-Kuhn-Tucker condition in multiobjective optimization
• scientific article; zbMATH DE number 2050765 (Why is no real title available?)

Describes a project that uses

Uses Software

• ALGENCAN

This page was built for publication: Approximate solutions to nonsmooth multiobjective programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5074081)