Properly optimal elements in vector optimization with variable ordering structures

G Eichfelder, R Kasimbeyli - Journal of Global Optimization, 2014 - Springer
In this paper, proper optimality concepts in vector optimization with variable ordering
structures are introduced for the first time and characterization results via scalarizations are …

Optimality conditions in nonconvex optimization via weak subdifferentials

R Kasimbeyli, M Mammadov - Nonlinear Analysis: Theory, Methods & …, 2011 - Elsevier
In this paper we study optimality conditions for optimization problems described by a special
class of directionally differentiable functions. The well-known necessary and sufficient …

Generalized Derivatives and Optimality Conditions in Nonconvex Optimization

GD Yalcin, R Kasimbeyli - Bulletin of the Malaysian Mathematical …, 2024 - Springer
In this paper, we study the radial epiderivative notion for nonconvex functions, which
extends the (classical) directional derivative concept. The paper presents new definition and …

CLUSTERING BASED POLYHEDRAL CONIC FUNCTIONS ALGORITHM IN CLASSIFICATION.

G Ozturk, MT Ciftci - Journal of Industrial & Management …, 2015 - search.ebscohost.com
In this study, a new algorithm based on polyhedral conic func tions (PCFs) is developed to
solve multi-class supervised data classiffication problems. The k PCFs are constructed for …

An incremental piecewise linear classifier based on polyhedral conic separation

G Ozturk, AM Bagirov, R Kasimbeyli - Machine Learning, 2015 - Springer
In this paper, a piecewise linear classifier based on polyhedral conic separation is
developed. This classifier builds nonlinear boundaries between classes using polyhedral …

Mixed type duality for set-valued optimization problems via higher-order radial epiderivatives

NLH Anh - Numerical Functional Analysis and Optimization, 2016 - Taylor & Francis
In this article, we introduce a notion of higher-order radial epiderivative for set-valued maps
and study its properties. A generalized concept of higher-order strict minimizers in set …

Weak subgradient method for solving nonsmooth nonconvex optimization problems

G Dinc Yalcin, R Kasimbeyli - Optimization, 2021 - Taylor & Francis
This paper presents a weak subgradient based method for solving nonconvex optimization
problems. The method uses a weak subgradient of the objective function at a current point to …

A sharp augmented Lagrangian-based method in constrained non-convex optimization

AM Bagirov, G Ozturk, R Kasimbeyli - Optimization Methods and …, 2019 - Taylor & Francis
In this paper, a novel sharp Augmented Lagrangian-based global optimization method is
developed for solving constrained non-convex optimization problems. The algorithm …

OPTIMALITY CONDITIONS FOR NONCONVEX MATHEMATICAL PROGRAMMING PROBLEMS USING WEAK SUBDIFFERENTIALS AND AUGMENTED NORMAL …

T VAN SU, CHU VAN TIEP - Applied Set-Valued Analysis & …, 2024 - search.ebscohost.com
In this paper, we study some characterizations of the class of weakly subdifferentiable
functions and formulate optimality conditions for nonconvex mathematical programming …

On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization

GD Yalcin, R Kasimbeyli - Mathematical Methods of Operations Research, 2020 - Springer
In this paper, zero duality gap conditions in nonconvex optimization are investigated. It is
considered that dual problems can be constructed with respect to the weak conjugate …