A dynamical approach to constrained nonsmooth convex minimization problem coupling with penalty function method in Hilbert space
DOI10.1080/01630563.2010.519134zbMATH Open1208.65083OpenAlexW2050339044MaRDI QIDQ3068655FDOQ3068655
Authors: Wei Bian, Xiaoping 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
Recommendations
- Evolution differential inclusion with projection for solving constrained nonsmooth convex optimization in Hilbert space
- scientific article; zbMATH DE number 4045488
- Constrained gradient method for nonsmooth optimization problems
- On the dynamics of a differential inclusion built upon a nonconvex constrained minimization problem
- Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Nonlinear total variation based noise removal algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Set-valued analysis
- A bundle-filter method for nonsmooth convex constrained optimization
- A second-order gradient-like dissipative dynamical system with Hessian-driven damping. Application to optimization and mechanics.
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- Augmented Lagrangian methods for nonsmooth, convex optimization in Hilbert spaces
- On multivalued evolution equations in Hilbert spaces
- Augmented Lagrangian-SQP-Methods in Hilbert Spaces and Application to Control in the Coefficients Problems
- A dynamical approach to convex minimization coupling approximation with the steepest descent method
- Continuous gradient projection method in Hilbert spaces
- Un exemple concernant le comportement asymptotique de la solution du problème \(du/dt+\partial\varphi(\mu)\ni=0\)
Cited In (4)
- Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms
- On the dynamics of a differential inclusion built upon a nonconvex constrained minimization problem
- Penalty approximation for dynamical systems submitted to multiple non-smooth constraints
- A one-layer recurrent neural network for solving pseudoconvex optimization with box set constraints
This page was built for publication: A dynamical approach to constrained nonsmooth convex minimization problem coupling with penalty function method in Hilbert space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068655)
