Výsledky vyhľadávania - smooth quasiconvex multiobjective programming problems with constraints

Second-order optimality conditions for efficiency in $$C^{1,1}$$-smooth quasiconvex multiobjective programming problem

Autori: Tran Van Su Dinh Dieu Hang

Zdroj: Computational and Applied Mathematics. 40

Predmety: 0211 other engineering and technologies, 02 engineering and technology

Prístupová URL adresa: https://link.springer.com/article/10.1007/s40314-021-01625-0

Constraint Qualifications and Optimality Conditions for Nonsmooth Semidefinite Multiobjective Programming Problems with Mixed Constraints Using Convexificators.

Autori: Upadhyay, Balendu Bhooshan Singh, Shubham Kumar Stancu-Minasian, Ioan

Zdroj: Mathematics (2227-7390); Oct2024, Vol. 12 Issue 20, p3202, 21p

Predmety: SEMIDEFINITE programming, SYMMETRIC spaces, SYMMETRIC matrices

Second-order optimality conditions for efficiency in C1,1-smooth quasiconvex multiobjective programming problem.

Autori: Su, Tran Van Hang, Dinh Dieu

Zdroj: Computational & Applied Mathematics; Sep2021, Vol. 40 Issue 6, p1-20, 20p

Robust Optimality and Duality for Nonsmooth Multiobjective Programming Problems with Vanishing Constraints Under Data Uncertainty.

Autori: Upadhyay, Balendu Bhooshan Singh, Shubham Kumar Stancu-Minasian, I. M. a ďalší

Zdroj: Algorithms; Nov2024, Vol. 17 Issue 11, p482, 30p

Predmety: ROBUST optimization, CONSTRAINED optimization

Constraint Qualifications and Optimality Criteria for Nonsmooth Multiobjective Programming Problems on Hadamard Manifolds.

Autori: Upadhyay, Balendu Bhooshan Ghosh, Arnav Treanţă, Savin

Zdroj: Journal of Optimization Theory & Applications; Feb2024, Vol. 200 Issue 2, p794-819, 26p

Predmety: SUBDIFFERENTIALS, SATISFACTION, MATHEMATICAL programming, GEODESICS

Constraint Qualifications for Nonsmooth Multiobjective Programming Problems with Switching Constraints on Hadamard Manifolds.

Autori: Upadhyay, Balendu Bhooshan Ghosh, Arnav Kanzi, Nader a ďalší

Zdroj: Bulletin of the Malaysian Mathematical Sciences Society; Jul2024, Vol. 47 Issue 4, p1-28, 28p

Strong Karush–Kuhn–Tucker optimality conditions for weak efficiency in constrained multiobjective programming problems in terms of mordukhovich subdifferentials.

Autori: Van Su, Tran Hien, Nguyen Duc

Zdroj: Optimization Letters; Jun2021, Vol. 15 Issue 4, p1175-1194, 20p

OPTIMALITY AND DUALITY FOR SEMIDEFINITE MULTIOBJECTIVE PROGRAMMING PROBLEMS USING CONVEXIFICATORS.

Autori: MISHRA, SHASHI KANT KUMAR, RAHUL LAHA, VIVEK a ďalší

Zdroj: Journal of Applied & Numerical Optimization; 2022, Vol. 4 Issue 1, p103-118, 16p

Predmety: SEMIDEFINITE programming, OPTIMAL control theory, CONVEX functions, DUALITY theory (Mathematics), CONSTRAINED optimization

On nondifferentiable semi-infinite multiobjective programming with interval-valued functions.

Autori: Antczak, Tadeusz Farajzadeh, Ali

Zdroj: Journal of Industrial & Management Optimization; Aug2023, Vol. 19 Issue 8, p1-26, 26p

Predmety: ABSOLUTE value, FUZZY sets, INTERVAL analysis

Optimality and duality for \begin{document}$ E $\end{document}-differentiable multiobjective programming problems involving \begin{document}$ E $\end{document}-type Ⅰ functions.

Autori: Abdulaleem, Najeeb

Zdroj: Journal of Industrial & Management Optimization; Feb2023, Vol. 19 Issue 2, p1513-1527, 15p

Optimality Criteria and Duality in Multiobjective Programming Involving Nonsmooth Invex Functions.

Autori: S. Nobakhtian

Zdroj: Journal of Global Optimization; Aug2006, Vol. 35 Issue 4, p593-606, 14p

Optimality Conditions and Duality in Nonsmooth Multiobjective Programs.

Autori: Do Sang Kim Hyo Jung Lee

Zdroj: Journal of Inequalities & Applications; 2010, Vol. 2010, p1-12, 12p

Predmety: DUALITY theory (Mathematics), CONVEX programming, MATHEMATICAL inequalities, NONSMOOTH optimization, CONVEX sets

Higher-order efficiency conditions for constrained vector equilibrium problems.

Autori: Su, Tran Van Luu, Do Van

Zdroj: Optimization; Sep2022, Vol. 71 Issue 9, p2613-2642, 30p

Predmety: BANACH spaces, EQUILIBRIUM, LAGRANGE multiplier

Constraint Qualifications and Optimality Conditions for Multiobjective Mathematical Programming Problems with Vanishing Constraints on Hadamard Manifolds.

Autori: Upadhyay, Balendu Bhooshan Ghosh, Arnav Treanţă, Savin a ďalší

Zdroj: Mathematics (2227-7390); Oct2024, Vol. 12 Issue 19, p3047, 24p

Predmety: MATHEMATICAL programming

Second-Order Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Problems on Hadamard Manifolds.

Autori: Upadhyay, Balendu Bhooshan Ghosh, Arnav Stancu-Minasian, I. M.

Zdroj: Asia-Pacific Journal of Operational Research; Apr2024, Vol. 41 Issue 2, p1-26, 26p

Predmety: GEODESICS

On Nonsmooth Multiobjective Semi-Infinite Programming Problems with Mixed Constraints.

Autori: Soroush, H.

Zdroj: Journal of Mathematical Extension; 2023, Vol. 17 Issue 1, p1-16, 16p

Pareto Efficiency Criteria and Duality for Multiobjective Fractional Programming Problems with Equilibrium Constraints on Hadamard Manifolds.

Autori: Ghosh, Arnav Upadhyay, Balendu Bhooshan Stancu-Minasian, I. M.

Zdroj: Mathematics (2227-7390); Sep2023, Vol. 11 Issue 17, p3649, 28p

Predmety: FRACTIONAL programming, EQUILIBRIUM

Self-adaptive algorithms for quasiconvex programming and applications to machine learning.

Autori: Thang, Tran Ngoc Hai, Trinh Ngoc

Zdroj: Computational & Applied Mathematics; Jun2024, Vol. 43 Issue 4, p1-16, 16p

Predmety: MACHINE learning, NONCONVEX programming, ALGORITHMS, FEATURE selection, SELF-adaptive software, CONSTRAINT programming, LOGISTIC regression analysis

Characterizations of the solution set of nonsmooth semi-infinite programming problems on Hadamard manifolds.

Autori: Upadhyay, Balendu Bhooshan Sain, Shivani

Zdroj: RAIRO: Operations Research (2804-7303); 2024, Vol. 58 Issue 4, p2817-2844, 28p

Predmety: LAGRANGIAN functions, SUBDIFFERENTIALS, GEODESICS, LAGRANGE multiplier

A neurodynamic approach for a class of pseudoconvex semivectorial bilevel optimization problems.

Autori: Thang, Tran Ngoc Hoang, Dao Minh Dung, Nguyen Viet

Zdroj: Optimization Methods & Software; Feb2025, Vol. 40 Issue 1, p129-156, 28p

Predmety: BILEVEL programming, PROBLEM solving, ALGORITHMS