Our approach is to search for locally optimal solutions of a nonsmooth optimization problem that is built to incorporate minimization objectives and constraints for multiple plants.
First, the clustering problem is formulated as a nonsmooth optimization problem.
We extend our previous work on nonsmooth H∞ synthesis to develop a nonsmooth optimization technique to compute local solutions to multiband synthesis problems.
This paper describes a nonsmooth optimization technique allowing to design a lateral flight control law for a highly flexible aircraft.
Based on the optimal value function reformulation approach, the linear semivectorial bilevel programming problem is transformed into a nonsmooth optimization problem, and a solution algorithm is proposed.
Then, based on the optimal value function reformulation approach, we transform the linear semivectorial bilevel programming problem into a nonsmooth optimization problem and propose an algorithm.
We present a nonsmooth optimization method suited for the multidisk problem and more generally, for programs where the maximum of an infinite family of nonconvex maximum eigenvalue functions is minimized.
These practical operation constraints which can usually be found at the same time in realistic power system operations make the economic load dispatch problem a nonsmooth optimization problem having complex and nonconvex features with heavy equality and inequality constraints.
Further, Soleimani-Damaneh considered Mond-Weir type and Wolfe type duals for a general nonsmooth optimization problem in Banach algebras.
Each of the critical bounds can be captured within a single step by processing a challenging nonconvex and nonsmooth optimization problem, known as a 0 1 mathematical program with equilibrium constraints or 0 1 MPEC.
