Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 66, 2017 - Issue 1
191
Views
10
CrossRef citations to date
0
Altmetric
Articles

On estimating the regular normal cone to constraint systems and stationarity conditions

&
Pages 61-92 | Received 20 Jan 2016, Accepted 19 Oct 2016, Published online: 31 Oct 2016

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (2)

Patrick Mehlitz. (2020) On the linear independence constraint qualification in disjunctive programming. Optimization 69:10, pages 2241-2277.
Read now

Articles from other publishers (8)

Zhuoyu Xiao & Jane J. Ye. (2023) Optimality conditions and constraint qualifications for cardinality constrained optimization problems. Numerical Algebra, Control and Optimization 0:0, pages 0-0.
Crossref
Matúš Benko, Michal Červinka & Tim Hoheisel. (2021) Sufficient Conditions for Metric Subregularity of Constraint Systems with Applications to Disjunctive and Ortho-Disjunctive Programs. Set-Valued and Variational Analysis 30:1, pages 143-177.
Crossref
Yan-Chao Liang & Jane J. Ye. (2021) Optimality Conditions and Exact Penalty for Mathematical Programs with Switching Constraints. Journal of Optimization Theory and Applications 190:1, pages 1-31.
Crossref
Hadis Mokhtavayi, Aghileh Heydari & Nader Kanzi. (2020) First-Order Optimality Conditions for Lipschitz Optimization Problems with Vanishing Constraints. Iranian Journal of Science and Technology, Transactions A: Science 44:6, pages 1853-1861.
Crossref
Patrick Mehlitz. (2019) Stationarity conditions and constraint qualifications for mathematical programs with switching constraints. Mathematical Programming 181:1, pages 149-186.
Crossref
Helmut Gfrerer. (2018) Linearized M-stationarity Conditions for General Optimization Problems. Set-Valued and Variational Analysis 27:3, pages 819-840.
Crossref
Francisco Benita & Patrick Mehlitz. (2018) Optimal Control Problems with Terminal Complementarity Constraints. SIAM Journal on Optimization 28:4, pages 3079-3104.
Crossref
Matúš Benko & Helmut Gfrerer. (2017) An SQP method for mathematical programs with vanishing constraints with strong convergence properties. Computational Optimization and Applications 67:2, pages 361-399.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.