Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization

DOI10.1007/s10107-005-0629-9zbMath1093.90059OpenAlexW1973198704MaRDI QIDQ2576736

Gongyun Zhao, Fanwen Meng, Defeng Sun

Publication date: 14 December 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0629-9

zbMATH Keywords

Moreau-Yosida regularizationGeneralized equationsSemismooth

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52)

Related Items

On how to solve large-scale log-determinant optimization problems, Clarke generalized Jacobian of the projection onto symmetric cones, Moreau-Yosida regularization of Lagrangian-dual functions for a class of convex optimization problems, First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints, An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem, Fast Moreau envelope computation I: Numerical algorithms, A stochastic model for risk management in global supply chain networks, A perturbation approach for an inverse quadratic programming problem, Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity, An augmented Lagrangian dual optimization approach to the \(H\)-weighted model updating problem, Subdifferential‐based implicit return‐mapping operators in computational plasticity, Finding robust minimizer for non-convex phase retrieval, A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem, A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems, Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization, A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization, Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions, The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones, Unnamed Item, Jacobian nonsingularity in nonlinear symmetric conic programming problems and its application, First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints, On the characterizations of solutions to perturbed l₁ conic optimization problem, The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming, Nonnegative inverse eigenvalue problems with partial eigendata, On the semismoothness of projection mappings and maximum eigenvalue functions, A partial proximal point algorithm for nuclear norm regularized matrix least squares problems, Inverse semidefinite quadratic programming problem with \(l_1\) norm measure, Inverse quadratic programming problem with \(l_1\) norm measure, A smoothing Newton method for a type of inverse semi-definite quadratic programming problem, Properties and simplifications of constitutive time‐discretized elastoplastic operators, Convergence rate of Newton's method for \(L_2\) spectral estimation, A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems, A smoothing projected Newton-type algorithm for semi-infinite programming, An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems, Generalized Newton Algorithms for Tilt-Stable Minimizers in Nonsmooth Optimization, Properties of equation reformulation of the Karush-Kuhn-Tucker condition for nonlinear second order cone optimization problems, A perturbation approach for an inverse quadratic programming problem over second-order cones, On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization, Unnamed Item, Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming, A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems, B-Subdifferentials of the Projection onto the Generalized Simplex, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the nearest correlation matrix--a problem from finance
• Subdifferentials of compactly Lipschitzian vector-valued functions
• An implicit-function theorem for \(C^{0,1}\)-equations and parametric \(C^{1,1}\)-optimization
• On the inverse function theorem
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• Nonsingularity conditions for multifunctions
• Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization
• Directionally nondifferentiable metric projection
• Solution of monotone complementarity problems with locally Lipschitzian functions
• Sensitivity analysis of generalized equations
• Properties of the Moreau-Yosida regularization of a piecewise \(C^2\) convex function
• On Nesterov's approach to semi-infinite programming
• Quadratic convergence of Newton's method for convex interpolation and smoothing
• A nonsmooth version of Newton's method
• Lipschitzian Multifunctions and a Lipschitzian Inverse Mapping Theorem
• Optimization and nonsmooth analysis
• Strongly Regular Generalized Equations
• On generalized differentials and subdifferentials of Lipschitz vector-valued functions
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• First Order Conditions for General Nonlinear Optimization
• Semismooth and Semiconvex Functions in Constrained Optimization
• Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
• Variational Analysis
• The Primal-Dual Active Set Strategy as a Semismooth Newton Method
• Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
• Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems
• Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
• Inverse and implicit function theorems forH-differentiable and semismooth functions
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Proximité et dualité dans un espace hilbertien
• Two Convex Counterexamples: A Discontinuous Envelope Function and a Nondifferentiable Nearest-Point Mapping
• Convex Analysis
• On the basic theorem of complementarity
• Semismooth Matrix-Valued Functions
• Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
• Convergence of Newton's method for convex best interpolation
• A further result on an implicit function theorem for locally Lipschitz functions