Nonsmooth method for constrained optimization
classification
🧮 math.OC
keywords
methodconstrainedinequalityoptimizationpenaltyproblemsalgorithmapplicability
read the original abstract
We propose an implicit iterative algorithm for an exact penalty method arising from inequality constrained optimization problems. A rapidly convergent fixed point method is developed for a regularized penalty functional. The applicability and feasibility of the proposed method is demonstrated using large scale inequality constrained problems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.