Results 71 to 80 of about 1,963,970 (223)
Subgradient Smoothing Method for Nonsmooth Nonconvex Optimization
In this chapter an unconstrained nonsmooth nonconvex optimization problem is considered and a method for solving this problem is developed. In this method the subproblem for finding search directions is reduced to the unconstrained minimization of a ...
A. M. Bagirov +7 more
core +1 more source
ABSTRACT We consider optimal control of the heat equation where the control variable appears linearly as a boundary control. We establish switching times optimization for bang–bang controls with multiple switching times. Particularly, representations of variational derivatives of the state and the cost w.r.t. switching times are given.
Georg Vossen
wiley +1 more source
Subgradient and bundle methods for nonsmooth optimization
The nonsmooth optimization methods can mainly be divided into two groups: subgradient and bundle methods. Usually, when developing new algorithms and testing them, the comparison is made between similar kinds of methods.
Napsu Karmitsa +5 more
core +1 more source
Implementation of novel methods of global and nonsmooth optimization : GANSO programming library [PDF]
We discuss the implementation of a number of modern methods of global and nonsmooth continuous optimization, based on the ideas of Rubinov, in a programming library GANSO.
Ugon, Julien, Beliakov, Gleb
core +1 more source
We deal with complementarity problems over second-order cones. The complementarity problem is an important class of problems in the real world and involves many optimization problems.
Yasushi Narushima +2 more
doaj +1 more source
A quasisecant method for nonsmooth multiobjective optimization and its application in image restoration [PDF]
Purpose: The purpose of this paper is to present an efficient iterative method for solving unconstrained locally Lipschitz multiobjective optimization problems.
Zohreh Akbari
doaj +1 more source
Distributed stochastic nonsmooth nonconvex optimization
Distributed consensus optimization has received considerable attention in recent years; several distributed consensus-based algorithms have been proposed for (nonsmooth) convex and (smooth) nonconvex objective functions. However, the behavior of these distributed algorithms on {\it nonconvex, nonsmooth and stochastic} objective functions is not ...
openaire +3 more sources
An Adaptive Multiple Shooting Strategy for Optimal Control
We study how multiple shooting affects the convergence of Newton‐type methods for optimal control, comparing several shooting strategies across 40 benchmark problems. The study covers interior‐point and sequential quadratic programming methods with both Quasi‐Newton approximations and exact Hessians.
Robert Lampel, Sebastian Sager
wiley +1 more source
An Inexact Nonsmooth Quadratic Regularization Algorithm
The quadratic regularization technique is widely used in the literature for constructing efficient algorithms, particularly for solving nonsmooth optimization problems.
Anliang Wang +2 more
doaj +1 more source
Mission‐Aligned Learning‐Informed Control of Autonomous Systems: Formulation and Foundations
ABSTRACT Research, innovation and practical capital investment have been increasing rapidly toward the realization of autonomous physical agents. This includes industrial and service robots, unmanned aerial vehicles, embedded control devices, and a number of other realizations of cybernetic/mechatronic implementations of intelligent autonomous devices.
Vyacheslav Kungurtsev +7 more
wiley +1 more source

