Penalty functions in subanalytic optimization
From MaRDI portal
Publication:4327959
DOI10.1080/02331939208843840zbMath0817.90103OpenAlexW2035321137MaRDI QIDQ4327959
Publication date: 27 March 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939208843840
Related Items
Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints ⋮ Error bounds in mathematical programming ⋮ From error bounds to the complexity of first-order descent methods for convex functions ⋮ Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints ⋮ Exact penalty and error bounds in DC programming ⋮ Local convergence of Newton's method for subanalytic variational inclusions ⋮ Tame functions are semismooth ⋮ A unifying theory of exactness of linear penalty functions ⋮ Parallel optimal control with multiple shooting, constraints aggregation and adjoint methods
Cites Work
