A resolution of Simon's maximal monotonicity problem.
A saddle point theorem for non-smooth functionals and problems at resonance.
A unified optimality condition for eigenvalue problems
A weak* approximation of subgradient of convex function
Abstract Subdifferential Calculus and Semi-Convex Functions
∗ The work is partially supported by NSFR Grant No MM 409/94.We develop an abstract subdifferential calculus for lower semicontinuous functions and investigate functions similar to convex functions. As application we give sufficient conditions for the integrability of a lower semicontinuous function.
An active set strategy based on the augmented Lagrangian formulation for image restoration
Lagrangian and augmented Lagrangian methods for nondifferentiable optimization problems that arise from the total bounded variation formulation of image restoration problems are analyzed. Conditional convergence of the Uzawa algorithm and unconditional convergence of the first order augmented Lagrangian schemes are discussed. A Newton type method based on an active set strategy defined by means of the dual variables is developed and analyzed. Numerical examples for blocky signals and images perturbed by...
An expression of classical dynamics
An extension of the inverse function theorem.
An optimal shape design problem for a hyperbolic hemivariational inequality
In this paper we consider hemivariational inequalities of hyperbolic type. The existence result for hemivariational inequality is given and the existence theorem for the optimal shape design problem is shown.
An overview of semi-infinite programming theory and related topics through a generalization of the alternative theorems.
We propose new alternative theorems for convex infinite systems which constitute the generalization of the corresponding to Gale, Farkas, Gordan and Motzkin. By means of these powerful results we establish new approaches to the Theory of Infinite Linear Inequality Systems, Perfect Duality, Semi-infinite Games and Optimality Theory for non-differentiable convex Semi-Infinite Programming Problem.
An unconstrained optimization technique for nonsmooth nonlinear complementarity problems.
Analyse des problèmes de forme par la dérivation des minimax
Approximate maximum principle for discrete approximations of optimal control systems with nonsmooth objectives and endpoint constraints
The paper studies discrete/finite-difference approximations of optimal control problems governed by continuous-time dynamical systems with endpoint constraints. Finite-difference systems, considered as parametric control problems with the decreasing step of discretization, occupy an intermediate position between continuous-time and discrete-time (with fixed steps) control processes and play a significant role in both qualitative and numerical aspects of optimal control. In this paper we derive an...
Approximate smoothings of locally Lipschitz functionals
The paper deals with approximation of locally Lipschitz functionals. A concept of approximation, based on the idea of graph approximation of the generalized gradient, is discussed and the existence of such approximations for locally Lipschitz functionals, defined on open domains in , is proved. Subsequently, the procedure of a smooth normal approximation of the class of regular sets (containing e.g. convex and/or epi-Lipschitz sets) is presented.
Autovalori di alcune disequazioni variazionali con vincoli puntati sulle derivate
Si studiano problemi di autovalori per disequazioni variazionali semilineari ellittiche con un ostacolo puntuale sulla derivata prima della funzione incognita. Si mette in particolare in evidenza il ruolo della «ipotesi di non tangenza» tra il convesso, che viene definito dalla condizione di ostacolo, e la sfera dello spazio funzionale, su cui è naturale studiare un problema di autovalori. Tale condizione viene analizzata in alcuni casi concreti e si indicano alcune ipotesi che, garantendone la...
C1,1 vector optimization problems and Riemann derivatives
Caractérisation de la dérivabilité des fonctions à partir de la dérivée directionnelle.
Characterizations of convex vector functions and optimization.
Characterizations of error bounds for lower semicontinuous functions on metric spaces
Refining the variational method introduced in Azé et al. [Nonlinear Anal. 49 (2002) 643-670], we give characterizations of the existence of so-called global and local error bounds, for lower semicontinuous functions defined on complete metric spaces. We thus provide a systematic and synthetic approach to the subject, emphasizing the special case of convex functions defined on arbitrary Banach spaces (refining the abstract part of Azé and Corvellec [SIAM J. Optim. 12 (2002) 913-927], and the characterization...
Characterizations of error bounds for lower semicontinuous functions on metric spaces
Refining the variational method introduced in Azé et al. [Nonlinear Anal. 49 (2002) 643-670], we give characterizations of the existence of so-called global and local error bounds, for lower semicontinuous functions defined on complete metric spaces. We thus provide a systematic and synthetic approach to the subject, emphasizing the special case of convex functions defined on arbitrary Banach spaces (refining the abstract part of Azé and Corvellec [SIAM J. Optim. 12 (2002) 913-927], and the characterization...