Second-order analysis of penalty function
From MaRDI portal
Publication:604260
DOI10.1007/s10957-010-9666-5zbMath1229.90146OpenAlexW1988336553MaRDI QIDQ604260
Publication date: 10 November 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-010-9666-5
generalized representation conditionsglobal exact penalty functionsweak second-order sufficient conditions
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions for non-finite valued convex composite functions
- Second-order global optimality conditions for convex composite optimization
- Directional derivatives of optimal solutions in smooth nonlinear programming
- Error bounds in mathematical programming
- Lagrange-type functions in constrained non-convex optimization.
- Pseudonormality and a Lagrange multiplier theory for constrained optimization
- Convex composite minimization with \(C^{1,1}\) functions
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- Necessary and Sufficient Conditions for a Local Minimum. 3: Second Order Conditions and Augmented Duality
- Calmness and Exact Penalization
- Optimization and nonsmooth analysis
- Exact penalty functions and stability in locally Lipschitz programming
- Second order necessary and sufficient conditions for convex composite NDO
- First- and Second-Order Epi-Differentiability in Nonlinear Programming
- Exact penalty functions in nonlinear programming
- Sufficient conditions for a globally exact penalty function without convexity
- Penalty methods for computing points that satisfy second order necessary conditions
- An Exact Penalization Viewpoint of Constrained Optimization
- Necessary and sufficient conditions for a penalty method to be exact
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- A lower bound for the controlling parameters of the exact penalty functions
- An exact lower order penalty function and its smoothing in nonlinear programming
- Exact Penalty Functions in Constrained Optimization
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Second-order Sufficiency and Quadratic Growth for Nonisolated Minima
- Decreasing Functions with Applications to Penalization
- Sufficiency of Exact Penalty Minimization
- Non-Linear Programming Via Penalty Functions
- An Exact Potential Method for Constrained Maxima
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
