๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Second-Order Variational Analysis in Optimization, Variational Stability, and Control: Theory, Algorithms, Applications

โœ Scribed by Boris S. Mordukhovich


Publisher
Springer
Year
2024
Tongue
English
Leaves
802
Series
Springer Series in Operations Research and Financial Engineering
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


This fundamental work is a sequel to monographs by the same author: Variational Analysis and Applications (2018) and the two Grundlehren volumes Variational Analysis and Generalized Differentiation: I Basic Theory, II Applications (2006). This present book is the first entirely devoted to second-order variational analysis with numerical algorithms and applications to practical models. It covers a wide range of topics including theoretical, numerical, and implementations that will interest researchers in analysis, applied mathematics, mathematical economics, engineering, and optimization. Inclusion of a variety of exercises and commentaries in each chapter allows the book to be used effectively in a course on this subject. This area has been well recognized as an important and rapidly developing area of nonlinear analysis and optimization with numerous applications. Consisting of 9 interrelated chapters, the book is self-contained with the inclusion of some preliminaries in Chapter 1.

Results presented are useful tools for characterizations of fundamental notions of variational stability of solutions for diverse classes of problems in optimization and optimal control, the study of variational convexity of extended-real-valued functions and their specifications and variational sufficiency in optimization. Explicit calculations and important applications of second-order subdifferentials associated with the achieved characterizations of variational stability and related concepts, to the design and justification of second-order numerical algorithms for solving various classes of optimization problems, nonsmooth equations, and subgradient systems, are included. Generalized Newtonian algorithms are presented that show local and global convergence with linear, superlinear, and quadratic convergence rates. Algorithms are implemented to address interesting practical problems from the fields of machine learning, statistics, imaging, and other areas.

โœฆ Table of Contents


Preface
Contents
1 Basic Concepts of Second-Order Analysis
1.1 Preliminaries from First-Order Variational Analysis
1.1.1 Generalized Normals to Sets and Geometric Results
1.1.2 Generalized Differentiation of Set-Valued Mappings
1.1.3 Variational and Subdifferential Properties ofFunctions
1.2 Second-Order Subdifferentials
1.2.1 Definitions and Elementary Properties
1.2.2 Partial Second-Order Subdifferentials
1.3 Prox-Regularity in Variational Analysis
1.3.1 Prox-Regular Functions and Sets
1.3.2 Prox-Regularity and Monotonicity
1.3.3 Moreau Envelopes and Proximal Mappings
1.4 Subgradient Graphical Derivatives
1.4.1 Definitions and Some Properties
1.4.2 Second-Order Relations for C1,1 Functions
1.4.3 Subgradient Graphical Derivatives andProx-Regularity
1.5 Second Subderivatives and Related Constructions
1.5.1 Second Subderivatives
1.5.2 Second Subderivatives Under Prox-Regularity
1.6 Exercises for Chapter 1
1.7 Commentaries to Chapter 1
2 Second-Order Subdifferential Calculus
2.1 Second-Order Chain Rules in Banach Spaces
2.1.1 Chain Rules for Full Second-Order Subdifferentials
2.1.2 Chain Rules for Partial Second-OrderSubdifferentials
2.2 Second-Order Calculus in Asplund Spaces
2.2.1 Calculus Rules for Full Second-OrderSubdifferentials
2.2.2 Calculus Rules for Partial Second-OrderSubdifferentials
2.3 Second-Order Chain Rules in Finite Dimensions
2.3.1 Finite-Dimensional Methods of Second-OrderCalculus
2.3.2 Chain Rules for Fully Amenable Compositions
2.4 Exercises for Chapter 2
2.5 Commentaries to Chapter 2
3 Evaluating Second-Order Subdifferentials
3.1 Second-Order Calculations for Polyhedral Systems
3.1.1 Polyhedral Systems
3.1.2 Regular Coderivatives of Normal Cone Mappings
3.1.3 Limiting Coderivatives of Normal Cone Mappings
3.2 Second-Order Calculations for Classes of Convex Piecewise...
3.2.1 Piecewise Linear Functions via First-Order Study
3.2.2 Calculating Regular Normals to SubdifferentialGraphs
3.2.3 Second-Order Calculations for CPWL Functions
3.2.4 Second-Order Calculations for Norms and Penalties
3.3 Second-Order Evaluations for Constraint Systems
3.3.1 Nonlinear Systems under LICQ and Revisiting Polyhedrality
3.3.2 Perturbed Constraint Systems under Calmness
3.3.3 Nonlinear Inequality Systems via CalmnessConditions
3.3.4 Nonlinear Constraint Systems without Calmness
3.4 Exercises for Chapter 3
3.5 Commentaries to Chapter 3
4 Lipschitzian Stability via Second-Order Subdifferentials
4.1 Robust Lipschitzian Behavior of Solution Mappings for Parametric Variational Systems
4.1.1 Robust Lipschitzian Stability in VariationalInequalities
4.1.2 Robust Lipschitzian Stability in GeneralizedEquations
4.2 Tilt Stability of Local Minimizers and Metric (Sub)Regularity of Subdifferentials
4.2.1 Tilt-Stable Local Minimizers
4.2.2 Strong Metric Regularity of Subgradient Mappings
4.2.3 Metric Subregularity and Regularity ofSubdifferentials
4.2.4 Second-Order Characterizations of Tilt Stability
4.3 Tilt-Stable Minimizers in Nonlinear Programming
4.3.1 Nonlinear Programs in Infinite Dimensions
4.3.2 Qualification Conditions in NonlinearProgramming
4.3.3 Second-Order Generalized Derivatives for NLPs
4.3.4 Point-Based Sufficient Conditions for TiltStability
4.3.5 Point-Based Characterizations of Tilt Stabilityin NLPs
4.3.6 Discussions and Examples for Tilt Stability in NLPs
4.4 Exercises for Chapter 4
4.5 Commentaries to Chapter 4
5 Full Stability of Local Minimizers
5.1 Full Stability in General Optimization Problems
5.1.1 Two Types of Full Stability for Local Minimizers
5.1.2 Characterizing Full Stability viaSecond-Order Growth
5.1.3 Full Stability via Second-Order Subdifferentials
5.1.4 Quantitative Characterizations of Full Stability
5.2 Stability Notions in Constrained Optimization
5.2.1 Relations to Strong Stability and Strong Regularity
5.2.2 Second-Order Stability Characterizations
5.2.3 Characterizations of Stability forComposite Problems
5.3 Full Stability Without Nondegeneracy
5.3.1 Full Stability in Nonlinear Programming
5.3.2 Full Stability in Polyhedric Programming
5.4 Stability Under Polyhedrality and Nondegeneracy
5.4.1 Mathematical Programs with Polyhedral Constraints
5.4.2 Extended Nonlinear Programming
5.4.3 Full Stability in Minimax Optimization
5.5 Stability Issues Without Polyhedrality
5.5.1 Qualification and Nondegeneracy Conditions in Second-Order Cone Programming
5.5.2 Full Stability in Second-Order Cone Programming
5.5.3 Stability Characterizations for Semidefinite Programs
5.6 Exercises for Chapter 5
5.7 Commentaries to Chapter 5
6 Full Stability in Variational Systems
6.1 Full Stability and Local Monotonicity in PVSs
6.1.1 Basic Notions and Standing Assumptions
6.1.2 Local Maximal Monotonicity in Hilbert Spaces
6.1.3 Point-based Characterizations of Local Monotonicity
6.2 Full Stability of PVSs under Partial Differentiability
6.2.1 Hรถlderian Full Stability in Two-Parametric PVSs
6.2.2 Lipschitzian Full Stability of Two-Parametric PVSs
6.2.3 Characterizing Full Stability in General PVSs
6.3 Full Stability in Nonsmooth PVSs
6.3.1 Calculating the Threshold of Prox-Regularity
6.3.2 Hรถlder and Lipschitz Properties of Generalized Projectors
6.3.3 Full Stability in PVSs under Strong Monotonicity
6.4 Lipschitzian Full Stability in Parametric Variationalโ€ฆ
6.4.1 Full Stability in Parametric Variational Inequalities
6.4.2 Full Stability in Parametric Variational Conditions
6.5 Exercises for Chapter 6
6.6 Commentaries to Chapter 6
7 Full Stability in PDE Optimal Control
7.1 Full Stability in Constrained Elliptic PDEs
7.1.1 Elliptic Problems with General Control Constraints
7.1.2 Polyhedric Pointwise Control Constraints
7.2 Elliptic PDEs with Unperturbed Control Constraints
7.2.1 Problem Formulation and Well-Posedness
7.2.2 Equivalence and Characterizations of Full Stability
7.3 Elliptic Systems with Perturbed Control Regions
7.3.1 Neighborhood Criteria for Elliptic Full Stability
7.3.2 Point-Based Characterizations of EllipticFull Stability
7.4 Exercises for Chapter 7
7.5 Commentaries to Chapter 7
8 Variational Convexity in Optimization
8.1 Local Maximal Monotonicity in Banach Spaces
8.1.1 Basic Definitions and Preliminaries
8.1.2 Equivalence and Resolvent Characterizations of Local Maximal Monotonicity
8.1.3 Preservation of Local Maximal Monotonicity
8.2 Variational and Strong Variational Convexity of Functions and Their Subgradient Descriptions
8.2.1 Variational and Strong Variational Convexity
8.2.2 Subgradient Descriptions of ฯƒ-Variational Convexity
8.3 Variational Convexity via Local Subdifferential Monotonicity and Convexity of Moreau Envelopes
8.3.1 Characterizations of Variational Convexity
8.3.2 Characterizations of Strong Variational Convexity
8.4 Variational Sufficiency in Optimization
8.4.1 Variational Sufficiency in Composite Problems
8.4.2 Variational Sufficiency in Nonlinear Programming
8.5 Exercises for Chapter 8
8.6 Commentaries to Chapter 8
9 Second-Order Numerical Variational Analysis
9.1 Local Newtonian Methods for Subgradient Inclusions
9.1.1 Solvability of Generalized Newton Systems
9.1.2 Semismooth* Sets and Set-Valued Mappings
9.1.3 Dual Local Newtonian Algorithm to Solve Gradient Equations for C1,1 Functions
9.1.4 Dual Local Newtonian Algorithm for Prox-Regular Subgradient Inclusions
9.1.5 Dual Local Newtonian Algorithm for Nonsmooth Optimization of Structured Sums
9.1.6 Applications to Regularized Least Square Problems
9.2 Globally Convergent Coderivative-Based Generalized Newton Methods for Nonsmooth Optimization
9.2.1 Generalized Damped Newton Method for C1,1 Optimization
9.2.2 Coderivative-Based Regularized Newton Method
9.3 Coderivative-Based Generalized Newton Methods for Convex Composite Optimization
9.4 Applications of the Coderivative-Based Newtonian Algorithms and Numerical Experiments
9.4.1 Testing C1,1 Optimization Problems
9.4.2 Solving Lasso Problems by Using GDNM and GRNM
9.4.3 Box-Constrained Quadratic Programming
9.5 Coderivative-Based Semi-Newton Method in Nonsmooth Difference Programming
9.5.1 Design and Justification of the Semi-Newton Algorithm in Nonconvex Difference Programming
9.5.2 Convergence Rates Under the Kurdykaโ€“ลojasiewicz Property
9.6 RCSN Applications to Structured Constrained Optimization and Practical Modeling
9.6.1 Minimization of Structured Sums
9.6.2 Nonconvex Optimization with Geometric Constraints
9.7 Exercises for Chapter 9
9.8 Commentaries on Chapter 9
References
List of Statements
List of Figures and Tables
Glossary of Notation and Acronyms
Subject Index


๐Ÿ“œ SIMILAR VOLUMES


Applications to Regular and Bang-Bang Co
โœ Nikolai P. Osmolovskii, Helmut Maurer ๐Ÿ“‚ Library ๐Ÿ“… 2012 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English

This book is devoted to the theory and applications of second-order necessary and sufficient optimality conditions in the calculus of variations and optimal control. The authors develop theory for a control problem with ordinary differential equations subject to boundary conditions of equality and i

Optimal Control: Theory, Algorithms, and
โœ William H. Hager, Panos M. Pardalos (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 1998 ๐Ÿ› Springer US ๐ŸŒ English

<p>February 27 - March 1, 1997, the conference Optimal Control: Theยญ ory, Algorithms, and Applications took place at the University of Florida, hosted by the Center for Applied Optimization. The conference brought together researchers from universities, industry, and government laboratoยญ ries in the

Duality in Optimization and Variational
โœ C.j. Goh ๐Ÿ“‚ Library ๐Ÿ“… 2002 ๐Ÿ› Taylor & Francis ๐ŸŒ English

This comprehensive volume covers a wide range of duality topics ranging from simple ideas in network flows to complex issues in non-convex optimization and multicriteria problems. In addition, it examines duality in the context of variational inequalities and vector variational inequalities, as gene

Nonsmooth Optimization: Analysis and Alg
โœ M'Akel'a M.M. ๐Ÿ“‚ Library ๐ŸŒ English

World Scientific Publishing Company, 1992. โ€” 268 p. โ€” ISBN-10: 9810207735.<div class="bb-sep"></div>This book is a self-contained elementary study for nonsmooth analysis and optimization, and their use in solution of nonsmooth optimal control problems. The first part of the book is concerned with no