Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency

DOI10.1007/S10957-020-01683-0zbMATH Open1447.90072OpenAlexW3035871225MaRDI QIDQ779866FDOQ779866

Authors: Meenakshi Gupta, Manjari Srivastava 

Publication date: 14 July 2020

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-020-01683-0

Recommendations

• On Levitin-Polyak well-posedness and stability in set optimization
• Levitin-Polyak well-posedness for set optimization problems
• Levitin-Polyak well-posedness for set optimization problems involving set order relations
• Characterizations of generalized Levitin-Polyak well-posed set optimization problems
• Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency

zbMATH Keywords

stabilityapproximate solutionrobust optimizationwell-posednessset optimizationset convergence

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48) Robustness in mathematical programming (90C17)

Cites Work

• Well-posedness for set optimization problems
• Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
• \(\epsilon\)-solutions in vector minimization problems
• Scalarization method for Levitin-Polyak well-posedness of vectorial optimization problems
• Title not available (Why is that?)
• Generalized \(B\)-well-posedness for set optimization problems
• Title not available (Why is that?)
• Set-valued optimization. An introduction with applications
• Set-valued analysis
• Well-posed optimization problems
• Set-valued optimization in welfare economics
• Extended well-posedness of quasiconvex vector optimization problems
• Some duality theorems of set-valued optimization with natural criteria
• Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
• A note on semicontinuity of the solution mapping for parametric set optimization problems
• Set Optimization—A Rather Short Introduction
• Title not available (Why is that?)
• Pointwise and global well-posedness in set optimization: a direct approach
• Scalarization of Levitin-Polyak well-posedness in vector optimization using weak efficiency
• Well-posedness and scalarization in set optimization involving ordering cones with possibly empty interior
• Partial order relations on family of sets and scalarizations for set optimization
• Characterizations of generalized Levitin-Polyak well-posed set optimization problems
• Approximate solutions of vector optimization problems via improvement sets in real linear spaces
• Scalarizations for a set optimization problem using generalized oriented distance function
• Characterizations of multiobjective robustness via oriented distance function and image space analysis
• Approximate solutions and scalarization in set-valued optimization
• External and internal stability in set optimization
• Title not available (Why is that?)
• Minimal element theorems and Ekeland's variational principle with new set order relations

Cited In (12)

• Continuity of the solutions sets for parametric set optimization problems
• Well-posedness of approximation and optimization problems for weakly convex sets and functions
• Solving Optimization Problems over the Weakly Efficient Set
• Approximate solutions for set optimization with an order cone that has nonempty quasirelative interiors
• Painlevé-Kuratowski convergence and extended well-posedness for set optimization problems
• An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set
• An unified scalarization and Ekeland's variational principle for partial set order
• Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency
• Levitin-Polyak well-posedness for set optimization problems
• An algorithm to solve polytopic set optimization problem based on a partial set order relation
• Image space analysis for set optimization problems with applications
• Characterizations of multi-objective robustness solutions defined by Minkowski set difference

This page was built for publication: Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency

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