Results 191 to 200 of about 24,030 (229)

Nonsmooth Optimization Based Clustering Algorithms

2020
In this chapter, we describe the clustering algorithms based on nonsmooth optimization approaches. First, we present the modified global k-means algorithm. Then the fast modified global k-means algorithm and its modifications are discussed. The limited memory bundle clustering and the discrete gradient based clustering algorithms are also described ...
Adil Bagirov, Napsu Karmitsa, Sona Taheri   +2 more
openaire   +1 more source

Nonsmooth Optimization Methods

1999
From the previous chapters we know that after the discretization, elliptic and parabolic hemivariational inequalities can be transformed into substationary point type problems for locally Lipschitz superpotentials and as such will be solved. There is a class of mathematical programming methods especially developed for this type of problems.
Jaroslav Haslinger, Markku Miettinen, Panagiotis D. Panagiotopoulos   +2 more
openaire   +1 more source

Nonsmooth Convex Optimization

2020
In this chapter, we study an extension of the projected subgradient method for minimization of convex and nonsmooth functions, under the presence of computational errors. The problem is described by an objective function and a set of feasible points. For this algorithm, each iteration consists of two steps.
openaire   +1 more source

On Mixed Integer Nonsmooth Optimization

2020
In this chapter we review some deterministic solution methods for convex mixed integer nonsmooth optimization problems. The methods are branch and bound, outer approximation, extended cutting plane, extended supporting hyperplane and extended level bundle method.
Westerlund Karl, Mäkelä Marko, Eronen Ville-Pekka, Westerlund Tapio   +3 more
openaire   +1 more source

Nonsmooth variational-like inequalities and nonsmooth vector optimization

Optimization Letters, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alshahrani, M., Ansari, Q. H., Al-Homidan, S.   +2 more
openaire   +1 more source

Necessary Conditions in Nonsmooth Optimization

Mathematics of Operations Research, 1984
The paper contains four theorems concerning first order necessary conditions for a minimum in nonsmooth optimization problems in Banach spaces: a Lagrange multiplier rule for a mathematical programming problem in which an infinite dimensional equality constraint is included in the constraints, a general maximum principle for nonsmooth optimal control ...
openaire   +2 more sources

Nonsmooth optimization: theory and algorithms

4OR, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Nonsmooth optimization in optimal control

Proceedings of the 28th IEEE Conference on Decision and Control, 2003
The aim of this study is to apply nonsmooth optimization to optimal control problems. The author describes the main ideas of K.C. Kiwiel's (1985) generalized cutting plane method and to the bundle method due to C. Lemarechal (1977) for generating a descent direction. He presents an optimal control problem which is a model of an elastic deflected string,
openaire   +1 more source

Theory of Nonsmooth Optimization

2020
Nonsmooth optimization refers to the general problem of minimizing or maximizing functions with discontinuous gradients. This chapter contains necessary information on theoretical nonsmooth optimization which is used to model clustering problems and to obtain necessary optimality conditions.
Adil M. Bagirov, Napsu Karmitsa, Sona Taheri   +2 more
openaire   +1 more source

Optimality conditions in nonsmooth optimization

Bulletin of the Australian Mathematical Society, 1994
This ``article'' is in fact the abstract of the author's Ph. D. thesis, the main thrust of which is to establish necessary and sufficient optimality conditions for minimization and maximization problems posed on abstract spaces. More particularly, the aim is to extend well-known optimality conditions for finite-dimensional problems, to the infinite ...
openaire   +2 more sources