Results 1 to 10 of about 22,374 (199)
An active-set algorithm for solving large-scale nonsmooth optimization models with box constraints. [PDF]
It is well known that the active set algorithm is very effective for smooth box constrained optimization. Many achievements have been obtained in this field.
Yong Li, Gonglin Yuan, Zhou Sheng
doaj +2 more sources
Proximal Bundle Method for Contact Shape Optimization Problem [PDF]
From the mathematical point of view, the contact shape optimization is a problem of nonlinear optimization with a specific structure, which can be exploited in its solution. In this paper, we show how to overcome the difficulties related to the nonsmooth
Nikola Plivova, Petr Beremlijski
doaj +4 more sources
Data-Driven Nonsmooth Optimization [PDF]
In this work, we consider methods for solving large-scale optimization problems with a possibly nonsmooth objective function. The key idea is to first specify a class of optimization algorithms using a generic iterative scheme involving only linear operations and applications of proximal operators.
Sebastian Banert +4 more
openaire +3 more sources
On solving elliptic obstacle problems by constant abs-linearization
We consider optimal control problems governed by an elliptic variational inequality of the first kind, namely the obstacle problem. The variational inequality is treated by penalization, which leads to optimization problems governed by a nonsmooth semi ...
Olga Weiß, Monika Weymuth
doaj +1 more source
Existence of Solutions for Nonconvex and Nonsmooth Vector Optimization Problems
We consider the weakly efficient solution for a class of nonconvex and nonsmooth vector optimization problems in Banach spaces. We show the equivalence between the nonconvex and nonsmooth vector optimization problem and the vector variational-like ...
Nan-Jing Huang +2 more
doaj +2 more sources
For enhancing the stability of the microgrid operation, this paper proposes an optimization model considering the small-signal stability constraint.
Peijie Li +3 more
doaj +1 more source
Nonsmooth optimization refers to the general problem of minimizing (or maximizing) functions that have discontinuous gradients. This Special Issue contains six research articles that collect together the most recent techniques and applications in the ...
Napsu Karmitsa, Sona Taheri
doaj +1 more source
Frank and Wolfe’s celebrated conditional gradient method is a well-known tool for solving smooth optimization problems for which minimizing a linear function over the feasible set is computationally cheap.
de Oliveira, Welington
doaj +1 more source
Asymptotic stationarity and regularity for nonsmooth optimization problems [PDF]
Based on the tools of limiting variational analysis, we derive a sequential necessary optimality condition for nonsmooth mathematical programs which holds without any additional assumptions. In order to ensure that stationary points in this new sense are
Patrick Mehlitz
doaj +1 more source
Certificates of infeasibility via nonsmooth optimization [PDF]
An important aspect in the solution process of constraint satisfaction problems is to identify exclusion boxes which are boxes that do not contain feasible points.
Fendl, Hannes +2 more
core +2 more sources

