Results 71 to 80 of about 969 (184)

Proximal Bundle Method for Contact Shape Optimization Problem

Advances in Electrical and Electronic Engineering, 2017
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   +1 more source

A Decomposition Method with Redistributed Subroutine for Constrained Nonconvex Optimization

Abstract and Applied Analysis, 2013
A class of constrained nonsmooth nonconvex optimization problems, that is, piecewise C2 objectives with smooth inequality constraints are discussed in this paper.
Yuan Lu, Wei Wang, Li-Ping Pang, Dan Li
doaj   +1 more source

State Estimation and Tracking Control of Saturation Sandwich Systems Based on Particle Swarm Optimization

IEEE Access
This paper proposes an integrated control framework combining a nonsmooth observer and a switching feedback law to address the state estimation and tracking control challenges of sandwich systems with saturation nonlinearities.
Xufeng Liu, Zupeng Zhou
doaj   +1 more source

Nonsmooth analysis and optimization on partially ordered vector spaces

International Journal of Mathematics and Mathematical Sciences, 1992
Interval-Lipschitz mappings between topological vector spaces are defined and compared with other Lipschitz-type operators. A theory of generalized gradients is presented when both spaces are locally convex and the range space is an order complete vector
Thomas W. Reiland
doaj   +1 more source

A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem

EURO Journal on Computational Optimization
We introduce a heuristic rule for calculating the stepsize in the subgradient method for unconstrained convex nonsmooth optimization which, unlike the classic approach, is based on retaining some information from previous iteration.
F. Carrabs, M. Gaudioso, G. Miglionico
doaj   +1 more source

Variational Optimality Conditions with Feedback Descent Controls that Strengthen the Maximum Principle

Известия Иркутского государственного университета: Серия "Математика", 2014
We derive nonlocal necessary optimality conditions that strengthen both classical and nonsmooth Maximum Principles for nonlinear optimal control problems with free right-hand end of trajectories.
V.A. Dykhta
doaj  

Delayed Star Subgradient Methods for Constrained Nondifferentiable Quasi-Convex Optimization

Algorithms
In this work, we consider the problem of minimizing a quasi-convex function over a nonempty closed convex constrained set. In order to approximate a solution of the considered problem, we propose delayed star subgradient methods.
Ontima Pankoon, Nimit Nimana
doaj   +1 more source

On a Monotone Scheme for Nonconvex Nonsmooth Optimization with Applications to Fracture Mechanics. [PDF]

J Optim Theory Appl, 2019
Ghilli D, Ghilli D, Kunisch K.
europepmc   +1 more source

On Parallel Complexity of Nonsmooth Convex Optimization

Journal of Complexity, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

The Cost of Nonconvexity in Deterministic Nonsmooth Optimization

Mathematics of Operations Research
We study the impact of nonconvexity on the complexity of nonsmooth optimization, emphasizing objectives such as piecewise linear functions, which may not be weakly convex. We focus on a dimension-independent analysis, slightly modifying a 2020 black-box algorithm of Zhang-Lin-Jegelka-Sra-Jadbabaie that approximates an ϵ-stationary point of any ...
Siyu Kong, Adrian S. Lewis
openaire   +3 more sources