Sufficient conditions for error bounds of difference functions and applications

DOI10.1007/s10898-016-0410-zzbMath1353.49026OpenAlexW2255725220MaRDI QIDQ727390

Nguyen Thi Van Hang, Jen-Chih Yao

Publication date: 6 December 2016

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-016-0410-z

zbMATH Keywords

Lagrange multiplierserror boundssubdifferentialexact penalty functiond.\,c. inequalities system

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Related Items

Higher-order error bound for the difference of two functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the problem of minimizing a difference of polyhedral convex functions under linear constraints
• Exact penalty and error bounds in DC programming
• Convex functions, monotone operators and differentiability.
• Error bounds for systems of lower semicontinuous functions in Asplund spaces
• Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
• On the variational principle
• Error bounds for convex differentiable inequality systems in Banach spaces
• Sufficient Conditions for Error Bounds
• Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
• Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
• A Condition Number for Differentiable Convex Inequalities
• Optimization and nonsmooth analysis
• Global Regularity Theorems
• Regular Points of Lipschitz Functions
• On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
• Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
• An Application of Error Bounds for Convex Programming in a Linear Space
• A New Approach to Lagrange Multipliers
• Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set

This page was built for publication: Sufficient conditions for error bounds of difference functions and applications