Add to ORKGThe article is devoted to the condition of R-regularity (Error Bound Property) in problems of mathematical programming. This condition plays an important role in analyzing the convergence of numerical optimization algorithms and it is a fairly general condition of regularity (constraint qualification) in problems of mathematical programming. The article obtains new sufficient conditions for the presence of R-regularity in problems of mathematical programming
We derive first- and second-order necessary optimality conditions for set-constrained optimization p...
We derive first- and second-order necessary optimality conditions for set-constrained optimization p...
This paper develops regularity conditions for a class of convex programming problems (convex objecti...
We present a new condition of constraint qualification and establish a second order necessary optima...
Numerous efforts in the literature are devoted to studying error bounds in optimization problems. Th...
Necessary and/or sufficient conditions are stated in order to have regularity for nondifferentiable ...
For minimization problems with equality and inequality constraints, first-and second-order necessary...
For minimization problems with equality and inequality constraints, first-and second-order necessary...
Originated from the practical implementation and numerical considerations of iterative methods for s...
We consider constraint qualifications in nonlinear programming which can be reduced to the classical...
A new first-order sufficient condition for penalty exactness that includes neither the standard cons...
A new first-order sufficient condition for penalty exactness that includes neither the standard cons...
Numerical optimization is often an essential aspect of mathematical analysis in science, technology ...
This paper presents a study of regularity of Semidefinite Programming (SDP) problems. Current metho...
We consider optimality systems of Karush-Kuhn-Tucker (KKT) type, which arise, for example, as primal...
We derive first- and second-order necessary optimality conditions for set-constrained optimization p...
We derive first- and second-order necessary optimality conditions for set-constrained optimization p...
This paper develops regularity conditions for a class of convex programming problems (convex objecti...
We present a new condition of constraint qualification and establish a second order necessary optima...
Numerous efforts in the literature are devoted to studying error bounds in optimization problems. Th...
Necessary and/or sufficient conditions are stated in order to have regularity for nondifferentiable ...
For minimization problems with equality and inequality constraints, first-and second-order necessary...
For minimization problems with equality and inequality constraints, first-and second-order necessary...
Originated from the practical implementation and numerical considerations of iterative methods for s...
We consider constraint qualifications in nonlinear programming which can be reduced to the classical...
A new first-order sufficient condition for penalty exactness that includes neither the standard cons...
A new first-order sufficient condition for penalty exactness that includes neither the standard cons...
Numerical optimization is often an essential aspect of mathematical analysis in science, technology ...
This paper presents a study of regularity of Semidefinite Programming (SDP) problems. Current metho...
We consider optimality systems of Karush-Kuhn-Tucker (KKT) type, which arise, for example, as primal...
We derive first- and second-order necessary optimality conditions for set-constrained optimization p...
We derive first- and second-order necessary optimality conditions for set-constrained optimization p...
This paper develops regularity conditions for a class of convex programming problems (convex objecti...