New uniform parametric error bounds

DOI10.1023/A:1022649217032MaRDI QIDQ1265051zbMATH OpenOpenAlexFDO

Authors K. Appert, Jane J. Ye

Publication date 28 February 1999

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022649217032

zbMATH Keywords

bilevel programming problemexact penalty functionsuniform parametric error boundsuniform weak sharp minima

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Hierarchical games (including Stackelberg games) (91A65)

Recommendations

• Error bounds revisited
• New upper bounds on error exponents
• On uniform global error bounds for convex inequalities
• scientific article; zbMATH DE number 4205635
• A new notion of error bounds: necessary and sufficient conditions
• Uniform error bounds for a continuous approximation of non-negative random variables
• scientific article; zbMATH DE number 67138
• New error bounds and their applications to convergence analysis of iterative algorithms
• Unified error bounds for all Newton-Cotes quadrature rules
• A unified derivation of several error bounds for Newton's process

Cites work

• A note on optimality conditions for bilevel programming problems^∗
• A simple characterization of solutions sets of convex programs
• Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces
• Error Bounds for Piecewise Convex Quadratic Programs and Applications
• Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
• scientific article; zbMATH DE number 439536 (Why is no real title available?)
• scientific article; zbMATH DE number 45255 (Why is no real title available?)
• scientific article; zbMATH DE number 1328979 (Why is no real title available?)
• Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
• Optimality conditions for bilevel programming problems
• Optimization and nonsmooth analysis
• Regular Points of Lipschitz Functions
• Weak Sharp Minima in Mathematical Programming

Cited in

(12)

• Bilevel road pricing: theoretical analysis and optimality conditions
• Equivalent conditions for local error bounds
• The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
• R-regularity of set-valued mappings under the relaxed constant positive linear dependence constraint qualification with applications to parametric and bilevel optimization
• Hölder error bounds and Hölder calmness with applications to convex semi-infinite optimization
• New upper bounds on error exponents
• Error bounds and metric subregularity
• New necessary optimality conditions in optimistic bilevel programming
• Extension of the value function reformulation to multiobjective bilevel optimization
• The generalized Mangasarian-Fromowitz constraint qualification and optimality conditions for bilevel programs
• Nonconvex quasi-variational inequalities: stability analysis and application to numerical optimization
• Global convergence of a second-order augmented Lagrangian method under an error bound condition

This page was built for publication: New uniform parametric error bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265051)