A Dynamical Approach to Constrained Nonsmooth Convex Minimization Problem Coupling with Penalty Function Method in Hilbert Space

DOI10.1080/01630563.2010.519134zbMath1208.65083OpenAlexW2050339044MaRDI QIDQ3068655

Wei Bian, Xiao-Ping Xue

Publication date: 17 January 2011

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2010.519134

zbMATH Keywords

strong convergenceweak convergenceconstraint nonsmooth convex orientation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (1)

A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Continuous gradient projection method in Hilbert spaces
• A bundle-filter method for nonsmooth convex constrained optimization
• Un exemple concernant le comportement asymptotique de la solution du problème \(du/dt+\partial\varphi(\mu)\ni=0\)
• A second-order gradient-like dissipative dynamical system with Hessian-driven damping. Application to optimization and mechanics.
• Augmented Lagrangian methods for nonsmooth, convex optimization in Hilbert spaces
• A dynamical approach to convex minimization coupling approximation with the steepest descent method
• On multivalued evolution equations in Hilbert spaces
• Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
• Augmented Lagrangian-SQP-Methods in Hilbert Spaces and Application to Control in the Coefficients Problems
• Set-valued analysis

This page was built for publication: A Dynamical Approach to Constrained Nonsmooth Convex Minimization Problem Coupling with Penalty Function Method in Hilbert Space