Results 41 to 50 of about 1,802,858 (209)

Proximal Linearized Iteratively Reweighted Algorithms for Nonconvex and Nonsmooth Optimization Problem

Axioms, 2022
The nonconvex and nonsmooth optimization problem has been attracting increasing attention in recent years in image processing and machine learning research. The algorithm-based reweighted step has been widely used in many applications.
Juyeb Yeo, Myeongmin Kang
doaj   +1 more source

New limited memory bundle method for large-scale nonsmooth optimization

, 2004
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of hundreds or thousands of variables. In such problems, the direct application of smooth gradient-based methods may lead to a failure due to the ...
Mäkelä, Marko M.,, Miettinen, Kaisa,, Haarala, M   +2 more
core   +1 more source

Operational Properties of SCN Function, Optimization Condition, and Exactness of Penalty Function for SCN Optimization

Journal of Mathematics
This paper defines a strong convertible nonconvex (SCN) function for solving the unconstrained optimization problems with the nonconvex or nonsmooth (nondifferentiable) function.
Min Jiang, Chuangyin Dang, Zhiqing Meng, Rui Shen   +3 more
doaj   +1 more source

A Quaternion-Valued Neural Network Approach to Nonsmooth Nonconvex Constrained Optimization in Quaternion Domain

, 2023
Based on the framework of differential inclusion, we design a quaternion-valued neural network (QVNN) to solve a class of nonsmooth nonconvex optimization problems with equality, bounded and inequality constraints in quaternion domain.
Liu, J, Liao, X, Dong, JS
core   +1 more source

MULTISYMPLECTIC VARIATIONAL INTEGRATORS FOR NONSMOOTH LAGRANGIAN CONTINUUM MECHANICS

Forum of Mathematics, Sigma, 2016
This paper develops the theory of multisymplectic variational integrators for nonsmooth continuum mechanics with constraints. Typical problems are the impact of an elastic body on a rigid plate or the collision of two elastic bodies.
FRANÇOIS DEMOURES, FRANÇOIS GAY-BALMAZ, TUDOR S. RATIU   +2 more
doaj   +1 more source

Weak Subdifferential in Nonsmooth Analysis and Optimization [PDF]

Journal of Applied Mathematics, 2011
Some properties of the weak subdifferential are considered in this paper. By using the definition and properties of the weak subdifferential which are described in the papers (Azimov and Gasimov, 1999; Kasimbeyli and Mammadov, 2009; Kasimbeyli and Inceoglu, 2010), the author proves some theorems connecting weak subdifferential in nonsmooth and ...
Sahlar F. Meherrem, Refet Polat
openaire   +6 more sources

The Barzilai and Borwein gradient method with nonmonotone line search for nonsmooth convex optimization problems

Mathematical Modelling and Analysis, 2012
The Barzilai and Borwein gradient algorithm has received a great deal of attention in recent decades since it is simple and effective for smooth optimization problems. Whether can it be extended to solve nonsmooth problems?
Gonglin Yuan, Zengxin Wei
doaj   +1 more source

Optimality and Duality Theorems in Nonsmooth Multiobjective Optimization [PDF]

Fixed Point Theory and Applications, 2011
Abstract In this paper, we consider a class of nonsmooth multiobjective programming problems. Necessary and sufficient optimality conditions are obtained under higher order strongly convexity for Lipschitz functions. We formulate Mond-Weir type dual problem and establish weak and strong duality theorems for a strict minimizer of order
Bae Kwan, Kim Do
openaire   +3 more sources

Substantiation of the backpropagation technique via the Hamilton—Pontryagin formalism for training nonconvex nonsmooth neural networks

Доповiдi Нацiональної академiї наук України
The paper observes the similarity between the stochastic optimal control over discrete dynamical systems and the lear ning multilayer neural networks. It focuses on contemporary deep networks with nonconvex nonsmooth loss and activation functions.
V.I. Norkin
doaj   +1 more source

An approximate ADMM for solving linearly constrained nonsmooth optimization problems with two blocks of variables

, 2019
Nonsmooth convex optimization problems with two blocks of variables subject to linear constraints are considered. A new version of the alternating direction method of multipliers is developed for solving these problems. In this method the subproblems are
Wu, Zhiyou, Bai, Fusheng, Fusheng Bai, Adil M. Bagirov, Zhiyou Wu, Bagirov, Adil, Taheri, Sona, Sona Taheri   +7 more
core   +1 more source