| Publication | Date of Publication | Type |
|---|
A parameter-free approach for solving SOS-convex semi-algebraic fractional programs
(available as arXiv preprint) | N/A | Paper |
Optimality conditions at infinity in semialgebraic vector optimization
Mathematics of Operations Research | 2026-09-15 | Paper |
SPLD polynomial optimization and bounded degree SOS hierarchies
Journal of Global Optimization | 2026-04-14 | Paper |
Merit function as a tool for vector polynomial optimization over an LMI constraint
Positivity | 2025-11-28 | Paper |
Approximate optimality conditions and sensitivity analysis in nearly convex optimization
Positivity | 2025-01-17 | Paper |
Fermat's rule at infinity in non-degenerate semi-algebraic optimization
Journal of Nonlinear and Convex Analysis | 2025-01-16 | Paper |
Generalized semi-infinite polynomial optimization and semidefinite programming relaxations
Acta Mathematica Vietnamica | 2024-12-09 | Paper |
On types of isolated KKT points in polynomial optimization
Journal of Systems Science and Complexity | 2024-08-29 | Paper |
On continuous selections of polynomial functions
Optimization | 2024-02-23 | Paper |
A utopia point method-based robust vector polynomial optimization scheme
Journal of Global Optimization | 2024-02-15 | Paper |
On approximate optimality conditions for robust multi-objective convex optimization problems
Optimization | 2023-08-14 | Paper |
A new scheme for approximating the weakly efficient solution set of vector rational optimization problems
Journal of Global Optimization | 2023-07-26 | Paper |
| scientific article; zbMATH DE number 7716269 (Why is no real title available?) | 2023-07-24 | Paper |
Optimality Conditions for Approximate Solutions of Nonsmooth Semi-Infinite Vector Optimization Problems
Continuous Optimization and Variational Inequalities | 2023-07-07 | Paper |
| Weakly quasi -efficiency for semi-infinite multi-objective optimization problems with locally Lipschitzian data | 2022-11-16 | Paper |
| Robust multi-objective optimization with SOS-convex polynomials over a polynomial matrix inequality | 2022-11-07 | Paper |
Existence of Pareto solutions for vector polynomial optimization problems with constraints
Journal of Optimization Theory and Applications | 2022-10-04 | Paper |
| Multi-criteria optimization problems with fractional objectives: approximate optimality and approximate duality | 2021-12-06 | Paper |
| Representation of the normal cone and its applications in robust minimax programming problems | 2021-11-15 | Paper |
| Approximate solutions in nonsmooth robust optimization with locally Lipschitz constraints | 2021-10-28 | Paper |
On solving a class of fractional semi-infinite polynomial programming problems
Computational Optimization and Applications | 2021-09-29 | Paper |
Existence of Pareto Solutions for Vector Polynomial Optimization Problems with Constraints
(available as arXiv preprint) | 2021-09-15 | Paper |
Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
Optimization Letters | 2021-07-08 | Paper |
Multi-objective convex polynomial optimization and semidefinite programming relaxations
Journal of Global Optimization | 2021-07-07 | Paper |
| scientific article; zbMATH DE number 7347486 (Why is no real title available?) | 2021-05-11 | Paper |
Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
Annals of Operations Research | 2021-05-05 | Paper |
Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
Taiwanese Journal of Mathematics | 2021-04-16 | Paper |
| Approximate optimality conditions for robust convex optimization without convexity of constraints | 2021-02-19 | Paper |
| Fractional optimization problems with support functions: exact SDP relaxations | 2021-02-19 | Paper |
On Solving a Class of Fractional Semi-infinite Polynomial Programming Problems
(available as arXiv preprint) | 2020-08-03 | Paper |
| On types of KKT points in polynomial optimization | 2020-04-26 | Paper |
A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
Operations Research Letters | 2020-04-07 | Paper |
Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
Taiwanese Journal of Mathematics | 2019-12-12 | Paper |
On a weakly C-\epsilon-vector saddle point approach in weak vector problems
Journal of Nonlinear and Variational Analysis | 2019-11-20 | Paper |
| Polynomial mathematical programs with equilibrium constraints and semidefinite programming relaxations | 2019-03-22 | Paper |
Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
Journal of Optimization Theory and Applications | 2018-04-13 | Paper |
Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
Journal of Optimization Theory and Applications | 2018-03-22 | Paper |
On quasi \(\epsilon\)-solution for robust convex optimization problems
Optimization Letters | 2017-12-15 | Paper |
Linesearch algorithms for split equilibrium problems and nonexpansive mappings
Fixed Point Theory and Applications | 2016-04-06 | Paper |
Optimality and mixed duality in multiobjective \(E\)-convex programming
Journal of Inequalities and Applications | 2016-03-30 | Paper |
Optimality conditions in nonconvex semi-infinite multiobjective optimization problems
Journal of Nonlinear and Convex Analysis | 2016-02-26 | Paper |
Higher-order duality in nondifferentiable multiobjective fractional programming involving cones
Journal of Nonlinear and Convex Analysis | 2016-02-12 | Paper |
| Convergence Analysis of Algorithms for DC Programming | 2015-08-16 | Paper |
| Mixed duality for a class of nondifferentiable multiobjective programming problems | 2015-03-06 | Paper |
