Results 251 to 260 of about 2,669 (290)
Some of the next articles are maybe not open access.
A class of constraint qualifications in nonsmooth optimization
Annals of Operations Research, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guohui Tian, Xiaofeng Li, Tianxia Zhao
openaire +1 more source
Notes on Some Constraint Qualifications for Mathematical Programs with Equilibrium Constraints
Journal of Optimization Theory and Applications, 2012From the introduction: ``Mathematical program with equilibrium constraints (MPEC) plays an important role in many fields such as engineering design, economic equilibria, transportation science, multilevel game, and mathematical programming itself. However, this kind of problems is generally difficult to deal with because their constraints fail to ...
Lei Guo 0016, Gui-Hua Lin
openaire +2 more sources
Necessary and Sufficient Constraint Qualification for Surrogate Duality
Journal of Optimization Theory and Applications, 2011The authors investigate necessary and sufficient constraint qualifications for surrogate duality closely related with ones for Lagrange-type dualities, in comparison with such as these conditions in the usual mathematical programming. Reviewer's remark: This paper is also important for proper numerical studies.
Satoshi Suzuki, Daishi Kuroiwa
openaire +2 more sources
Avoiding a Constraint Qualification
Optimization, 1997Necessary conditions are given for a constrained minimum, which do not assume any constraint qualification. The conditions relate to a cone, depending on constraint gradients at points near the minimum. They generalize a sufficient condition due to Hanson Under an invexity hypothesis.
openaire +1 more source
A Cone-Continuity Constraint Qualification and Algorithmic Consequences
SIAM Journal on Optimization, 2016Summary: Every local minimizer of a smooth constrained optimization problem satisfies the sequential approximate Karush-Kuhn-Tucker (AKKT) condition. This optimality condition is used to define the stopping criteria of many practical nonlinear programming algorithms.
Roberto Andreani +3 more
openaire +2 more sources
Constraint Qualifications in Nonsmooth Multiobjective Optimization
Journal of Optimization Theory and Applications, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Implications of the constant rank constraint qualification
Mathematical Programming, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Constraint qualifications for nonsmooth programming
Optimization, 2018ABSTRACTBy using an implicit function theorem and a result of error bound, we provide new constraint qualifications ensuring the Karush–Kuhn–Tuker necessary optimality conditions for both smooth and nonsmooth optimization problems in normed spaces or Banach spaces.
Liren Huang, Lulin Tan, Chunguang Liu
openaire +1 more source
On a constraint qualification in a nondifferentiable programming problem
Naval Research Logistics Quarterly, 1976AbstractA mathematical programming problem with an objective function containing the square root of a positive semidefinite quadratic form has been considered by Mond. In order to use a transposition theorem of Eisenberg, Mond introduces a complicated constraint qualification.
Mond, Bertram, Schechter, Murray
openaire +1 more source
A parametric view on the Mangasarian-Fromovitz constraint qualification
Mathematical Programming, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources