Results 21 to 30 of about 1,963,970 (223)
Variational Methods for Nonsmooth Mechanics [PDF]
, 2003 In this thesis we investigate nonsmooth classical and continuum mechanics and its discretizations by means of variational numerical and geometric methods.
Fetecau, Razvan Constantin
core +1 more source
A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
Journal of Inequalities and Applications, 2020 The subspace technique has been widely used to solve unconstrained/constrained optimization problems and there exist many results that have been obtained. In this paper, a subspace algorithm combining with limited memory BFGS update is proposed for large-
Xiangrong Li
doaj +1 more source
A Novel Approach for Solving Nonsmooth Optimization Problems with Application to Nonsmooth Equations
Journal of Mathematics, 2013 We present a new approach for solving nonsmooth optimization problems and a system of nonsmooth equations which is based on generalized derivative. For this purpose, we introduce the first order of generalized Taylor expansion of nonsmooth functions and
Hamid Reza Erfanian +2 more
doaj +1 more source
A modified three-term HS conjugate gradient method for solving nonsmooth minimizations
Journal of Hebei University of Science and Technology, 2018 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
International Journal of Applied Mathematics and Computer Science, 2023 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
Proximal ADMM for nonconvex and nonsmooth optimization
Automatica, 2022 15 pges, 3 ...
Yu Yang 0008 +4 more
openaire +4 more sources
Bundle methods for nonsmooth DC optimization
, 2020 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
Computation, 2022 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
Mathematics, 2022 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
EURO Journal on Computational Optimization, 2015 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