On the Calculus of Limiting Subjets on Riemannian Manifolds

In this paper fuzzy calculus rules for subjets of order two on finite dimensional Riemannian manifolds are obtained. Then a second order singular subjet derived from a sequence of efficient subsets of symmetric matrices is introduced. Employing fuzzy calculus rules for subjets of order two and various qualification assumptions based on a second order singular subjet, calculus rules for limiting subjets on a finite dimensional Riemannian manifold are obtianed.     

The Penalty Functions Method and Multiplier Rules Based on the Mordukhovich Subdifferential

We show that the finite-dimensional Fritz John multiplier rule, which is based on the limiting/Mordukhovich subdifferential, can be proved by using differentiable penalty functions and the basic calculus tools in variational analysis. The corresponding Kuhn–Tucker multiplier rule is derived from the Fritz John multiplier rule by imposing a constraint qualification condition or the exactness of an ?₁ penalty function. Complementing the existing proofs, our proofs provide another viewpoint on the fundamental multiplier rules employing the Mordukhovich subdifferential.     

On local convergence of sequential quadratically-constrained quadratic-programming type methods,with an extension to variational problems

We consider the class of quadratically-constrained quadratic-programming methods in the framework extended from optimization to more general variational problems. Previously, in the optimization case, Anitescu (SIAM J. Optim. 12, 949–978, 2002) showed superlinear convergence of the primal sequence under the Mangasarian-Fromovitz constraint qualification and the quadratic growth condition. Quadratic convergence of the primal-dual sequence was established by Fukushima, Luo and Tseng (SIAM J. Optim. 13, 1098–1119, 2003) under the assumption of convexity, the Slater constraint qualification, and a strong second-order sufficient condition. We obtain a new local convergence result, which complements the above (it is neither stronger nor weaker): we prove primal-dual quadratic convergence under the linear independence constraint qualification, strict complementarity, and a second-order sufficiency condition. Additionally, our results apply to variational problems beyond the optimization case. Finally, we provide a necessary and sufficient condition for superlinear convergence of the primal sequence under a Dennis-Moré type condition. Research of the second author is partially supported by CNPq Grants 300734/95-6 and 471780/2003-0, by PRONEX–Optimization, and by FAPERJ.     

On Metric and Calmness Qualification Conditions in Subdifferential Calculus

The paper contains two groups of results. The first are criteria for calmness/subregularity for set-valued mappings between finite-dimensional spaces. We give a new sufficient condition whose subregularity part has the same form as the coderivative criterion for “full” metric regularity but involves a different type of coderivative which is introduced in the paper. We also show that the condition is necessary for mappings with convex graphs. The second group of results deals with the basic calculus rules of nonsmooth subdifferential calculus. For each of the rules we state two qualification conditions: one in terms of calmness/subregularity of certain set-valued mappings and the other as a metric estimate (not necessarily directly associated with aforementioned calmness/subregularity property). The conditions are shown to be weaker than the standard Mordukhovich–Rockafellar subdifferential qualification condition; in particular they cover the cases of convex polyhedral set-valued mappings and, more generally, mappings with semi-linear graphs. Relative strength of the conditions is thoroughly analyzed. We also show, for each of the calculus rules, that the standard qualification conditions are equivalent to “full” metric regularity of precisely the same mappings that are involved in the subregularity version of our calmness/subregularity condition. The research of Jiří V. Outrata was supported by the grant A 107 5402 of the Grant Agency of the Academy of Sciences of the Czech Republic.     

Optimality Conditions and Stability Analysis via the Mordukhovich Subdifferential

This article shows that finite-dimensional multiplier rules, which are based on the limiting subdifferential, can be proved by Ekeland's variational principle and some basic calculus tools of the generalized differentiation theory introduced by B. S. Mordukhovich. Consequences of a limiting constraint qualification, which yields the normal form of the multiplier rules, stability and calmness of optimization problems, are investigated in detail.     

Codifferential Calculus

In this paper, some exact calculus rules are obtained for calculating the coderivatives of the composition of two multivalued maps. Similar rules are displayed for sums. A crucial role is played by an intermediate set-valued map called the resolvent. We first establish inclusions for contingent, Fréchet and limiting coderivatives. Combining them, we get equality rules. The qualification conditions we present are natural and less exacting than classical conditions.     

Optimality Conditions for Disjunctive Programs with Application to Mathematical Programs with Equilibrium Constraints

We consider optimization problems with a disjunctive structure of the feasible set. Using Guignard-type constraint qualifications for these optimization problems and exploiting some results for the limiting normal cone by Mordukhovich, we derive different optimality conditions. Furthermore, we specialize these results to mathematical programs with equilibrium constraints. In particular, we show that a new constraint qualification, weaker than any other constraint qualification used in the literature, is enough in order to show that a local minimum results in a so-called M-stationary point. Additional assumptions are also discussed which guarantee that such an M-stationary point is in fact a strongly stationary point.      

广义扰动映射的上导数

主要讨论了两集值映射和的上导数．在比标准约束品性弱的条件下得到了两个集值映射和的上导数与两集值映射上导数的和之间的包含关系,并将此结论用于讨论广义扰动映射的上导数,得到广义扰动映射的上导数的上界估计．     

On Second-Order Optimality Conditions for Vector Optimization

In this article, two second-order constraint qualifications for the vector optimization problem are introduced, that come from first-order constraint qualifications, originally devised for the scalar case. The first is based on the classical feasible arc constraint qualification, proposed by Kuhn and Tucker (Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 481–492, University of California Press, California, 1951) together with a slight modification of McCormick’s second-order constraint qualification. The second—the constant rank constraint qualification—was introduced by Janin (Math. Program. Stud. 21:110–126, 1984). They are used to establish two second-order necessary conditions for the vector optimization problem, with general nonlinear constraints, without any convexity assumption.     

Viscosity Coderivatives and Their Limiting Behavior in Smooth Banach Spaces

This paper concerns with generalized differentiation of set-valued and nonsmooth mappings between Banach spaces. We study the so-called viscosity coderivatives of multifunctions and their limiting behavior under certain geometric assumptions on spaces in question related to the existence of smooth bump functions of any kind. The main results include various calculus rules for viscosity coderivatives and their topological limits. They are important in applications to variational analysis and optimization.     

Extensions of Fréchet ?-Subdifferential Calculus and Applications

In this paper, we establish some calculus rules for the limiting Fréchet ?-subdifferentials of marginal functions and composite functions. Necessary conditions for approximate solutions of a constrained optimization problem are derived.     

Metric regularity,tangent sets,and second-order optimality conditions

A strong regularity theorem is proved, which shows that the usual constraint qualification conditions ensuring the regularity of the set-valued maps expressing feasibility in optimization problems, are in fact minimal assumptions. These results are then used to derive calculus rules for second-order tangent sets, allowing us in turn to obtain a second-order (Lagrangian) necessary condition for optimality which completes the usual one of positive semidefiniteness on the Hessian of the Lagrangian function.On leave from Universidad de Chile, Casilla 170/3 Correo 3, Santiago, Chile.     

A note on entropy inequalities and error estimates for higher-order accurate finite volume schemes on irregular families of grids

Recently, Cockburn, Coquel and LeFloch proved convergence and error estimates for higher-order finite volume schemes. Their result is based on entropy inequalities which are derived under restrictive assumptions on either the flux function or the numerical fluxes. Moreover, they assume that the spatial grid satisfies a standard regularity assumption. Using instead entropy inequalities derived in previous work by Kröner, Noelle and Rokyta and a weaker condition on the grid, we can generalize and simplify the error estimates.

     

Circular proofs for the modal mu-calculus

Inspired by Stirling's tableau proofs [4] we introduce a finite, cut-free sound and complete sequent calculus for the modal mu-calculus. Proofs in this system are finite trees in which leaves are either axioms or assumptions that are discharged by a specific rule of the calculus. The discharge rules provide a way to unfold assumptions motivating the name circular proofs. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Generalized Qualification and Qualification Levels for Spectral Regularization Methods

The concept of qualification for spectral regularization methods (SRM) for inverse ill-posed problems is strongly associated to the optimal order of convergence of the regularization error (Engl et al. in Regularization of inverse problems. Mathematics and its applications, vol. 375, Kluwer Academic, Dordrecht, 1996; Mathé in SIAM J. Numer. Anal. 42(3):968–973, 2004; Mathé and Pereverzev in Inverse Probl. 19(3):789–803, 2003; Vainikko in USSR Comput. Math. Math. Phys. 22(3): 1–19, 1982). In this article, the definition of qualification is extended and three different levels are introduced: weak, strong and optimal. It is shown that the weak qualification extends the definition introduced by Mathé and Pereverzev (Inverse Probl. 19(3):789–803, 2003), mainly in the sense that the functions associated with orders of convergence and source sets need not be the same. It is shown that certain methods possessing infinite classical qualification (e.g. truncated singular value decomposition (TSVD), Landweber’s method and Showalter’s method) also have generalized qualification leading to an optimal order of convergence of the regularization error. Sufficient conditions for a SRM to have weak qualification are provided and necessary and sufficient conditions for a given order of convergence to be strong or optimal qualification are found. Examples of all three qualification levels are provided and the relationships between them as well as with the classical concept of qualification and the qualification introduced in Mathé and Pereverzev (Inverse Probl. 19(3):789–803, 2003) are shown. In particular, SRMs having extended qualification in each one of the three levels and having zero or infinite classical qualification are presented. Finally, several implications of this theory in the context of orders of convergence, converse results and maximal source sets for inverse ill-posed problems, are shown. This work was supported by DARPA/SPO, NASA LaRC and the National Institute of Aerospace under Grant VT-03-1, 2535, by AFOSR Grants F49620-03-1-0243 and FA9550-07-1-0273, by Consejo Nacional de Investigaciones Científicas y Técnicas, CONICET, and by Universidad Nacional del Litoral, U.N.L., Argentina, through Project CAI+D 2006, P.E. 236.     

A graphon approach to limiting spectral distributions of Wigner‐type matrices

We present a new approach, based on graphon theory, to finding the limiting spectral distributions of general Wigner‐type matrices. This approach determines the moments of the limiting measures and the equations of their Stieltjes transforms explicitly with weaker assumptions on the convergence of variance profiles than previous results. As applications, we give a new proof of the semicircle law for generalized Wigner matrices and determine the limiting spectral distributions for three sparse inhomogeneous random graph models with sparsity ω(1/n): inhomogeneous random graphs with roughly equal expected degrees, W‐random graphs and stochastic block models with a growing number of blocks. Furthermore, we show our theorems can be applied to random Gram matrices with a variance profile for which we can find the limiting spectral distributions under weaker assumptions than previous results.     

Constant-Rank Condition and Second-Order Constraint Qualification

The constant-rank condition for feasible points of nonlinear programming problems was defined by Janin (Math. Program. Study 21:127–138, 1984). In that paper, the author proved that the constant-rank condition is a first-order constraint qualification. In this work, we prove that the constant-rank condition is also a second-order constraint qualification. We define other second-order constraint qualifications.     

Equivalence of Two Nondegeneracy Conditions for Semidefinite Programs

Nondegeneracy assumptions are often needed in order to prove the local fast convergence of suitable algorithms as well as in the sensitivity analysis for semidefinite programs. One of the more standard nondegeneracy conditions is the geometric condition used by Alizadeh et al. (Math. Program. 77:111–128, 1997). On the other hand, Kanzow and Nagel (SIAM J. Optim. 15:654–672, 2005) recently introduced an algebraic condition that was used in order to prove, for the first time, the local quadratic convergence of a suitable algorithm for the solution of semidefinite programs without using the strict complementarity assumption. The aim of this paper is to show that these two nondegeneracy conditions are equivalent.     

Stabilized SQP revisited

The stabilized version of the sequential quadratic programming algorithm (sSQP) had been developed in order to achieve superlinear convergence in situations when the Lagrange multipliers associated to a solution are not unique. Within the framework of Fischer (Math Program 94:91–124, 2002), the key to local superlinear convergence of sSQP are the following two properties: upper Lipschitzian behavior of solutions of the Karush-Kuhn-Tucker (KKT) system under canonical perturbations and local solvability of sSQP subproblems with the associated primal-dual step being of the order of the distance from the current iterate to the solution set of the unperturbed KKT system. According to Fernández and Solodov (Math Program 125:47–73, 2010), both of these properties are ensured by the second-order sufficient optimality condition (SOSC) without any constraint qualification assumptions. In this paper, we state precise relationships between the upper Lipschitzian property of solutions of KKT systems, error bounds for KKT systems, the notion of critical Lagrange multipliers (a subclass of multipliers that violate SOSC in a very special way), the second-order necessary condition for optimality, and solvability of sSQP subproblems. Moreover, for the problem with equality constraints only, we prove superlinear convergence of sSQP under the assumption that the dual starting point is close to a noncritical multiplier. Since noncritical multipliers include all those satisfying SOSC but are not limited to them, we believe this gives the first superlinear convergence result for any Newtonian method for constrained optimization under assumptions that do not include any constraint qualifications and are weaker than SOSC. In the general case when inequality constraints are present, we show that such a relaxation of assumptions is not possible. We also consider applying sSQP to the problem where inequality constraints are reformulated into equalities using slack variables, and discuss the assumptions needed for convergence in this approach. We conclude with consequences for local regularization methods proposed in (Izmailov and Solodov SIAM J Optim 16:210–228, 2004; Wright SIAM J. Optim. 15:673–676, 2005). In particular, we show that these methods are still locally superlinearly convergent under the noncritical multiplier assumption, weaker than SOSC employed originally.     

The Generalized Mangasarian-Fromowitz Constraint Qualification and Optimality Conditions for Bilevel Programs

We consider the optimal value reformulation of the bilevel programming problem. It is shown that the Mangasarian-Fromowitz constraint qualification in terms of the basic generalized differentiation constructions of Mordukhovich, which is weaker than the one in terms of Clarke’s nonsmooth tools, fails without any restrictive assumption. Some weakened forms of this constraint qualification are then suggested, in order to derive Karush-Kuhn-Tucker type optimality conditions for the aforementioned problem. Considering the partial calmness, a new characterization is suggested and the link with the previous constraint qualifications is analyzed.