Results 21 to 30 of about 1,802,858 (209)
A modified three-term HS conjugate gradient method for solving nonsmooth minimizations
To improve the efficiency for large-scale nonsmooth optimization problems and overcome the large storage requirements and complex computation of other algorithms, a modified HS conjugate gradient algorithm for nonsmooth optimization problems is proposed.
Yong LI, Songhua WANG
doaj +1 more source
Proximal ADMM for nonconvex and nonsmooth optimization
15 pges, 3 ...
Yu Yang 0008 +4 more
openaire +4 more sources
A nonsmooth optimization control (NOC) based on a sandwich model with hysteresis is proposed to control a micropositioning system (MPS) with a piezoelectric actuator (PEA).
Yang Sen +3 more
doaj +1 more source
Optimizing condition numbers [PDF]
In this paper we study the problem of minimizing condition numbers over a compact convex subset of the cone of symmetric positive semidefinite $n\times n$ matrices. We show that the condition number is a Clarke regular strongly pseudoconvex function.
Maréchal, Pierre, Ye, Jane
core +1 more source
This article deals with the classes of approximate Minty- and Stampacchia-type vector variational inequalities on Hadamard manifolds and a class of nonsmooth interval-valued vector optimization problems.
Savin Treanţă +2 more
doaj +1 more source
Bundle methods for nonsmooth DC optimization
This chapter is devoted to algorithms for solving nonsmooth unconstrained difference of convex optimization problems. Different types of stationarity conditions are discussed and the relationship between sets of different stationary points (critical ...
Joki, Kaisa, Bagirov, Adil
core +1 more source
Balanced Circular Packing Problems with Distance Constraints
The packing of different circles in a circular container under balancing and distance conditions is considered. Two problems are studied: the first minimizes the container’s radius, while the second maximizes the minimal distance between circles, as well
Tetyana Romanova +6 more
doaj +1 more source
Many real-world optimization models comprise nonconvex and nonsmooth functions leading to very hard classes of optimization models. In this article, a new interior-point method for the special, but practically relevant class of optimization problems with
Martin Schmidt
doaj +1 more source
Nonsmooth Optimization Techniques for Semisupervised Classification [PDF]
We apply nonsmooth optimization techniques to classification problems, with particular reference to the TSVM (Transductive Support Vector Machine) approach, where the considered decision function is nonconvex and nondifferentiable and then difficult to minimize.
Astorino A, FUDULI, Antonio
openaire +3 more sources
Discrete gradient method : Derivative-free method for nonsmooth optimization [PDF]
A new derivative-free method is developed for solving unconstrained nonsmooth optimization problems. This method is based on the notion of a discrete gradient.
Bagirov, A. M. +4 more
core +1 more source

