First- and second-order directional differentiability of locally Lipschitzian functions

In this paper, characterizations of the existence of the directional derivative and second-order parabolic directional derivative of a locally Lipschitzian function are established. These characterizations involve the adjacent cone and second-order adjacent set of the graph of the function.     

A chain rule for parabolic second-order epiderivatives

Just as first-order directional derivatives can be associated with concepts of tangent cone, so second-order directional derivatives of parabolic type can be naturally and profitably associated with second-order tangent sets. In this paper, a chain rule is presented for second-order directional derivatives whose corresponding tangent sets satisfy a short list of properties. This chain rule subsumes and sharpens previous results from the calculus of first- and second-order directional derivatives. Corollaries include second-order necessary optimality conditions for nondifferentiable programs.     

奇异值函数的二阶方向导数

本文用一个直接的方法给出了奇异值函数的二阶方向导数公式. 作为应用, 利用这一公式建立了谱范数的上图集合与核范数的上图集合的切锥和二阶切集的具体表达式, 这些表达式在矩阵优化的一阶和二阶最优条件的研究中起着重要作用.     

Contingent cone to a set defined by equality and inequality constraints at a Fréchet differentiable point

In this paper, we prove equality expression for the contingent cone and the strict normal cone to a set determined by equality and/or inequality constraints at a Fréchet differentiable point. A similar result has appeared before in the literature under the assumption that all the constraint functions are of classC or under the assumption that the functions are strictly differentiable at the point in question. Our result has applications to the calculation of various kinds of tangent cones and normal cones.This research was supported, in part by the National Science and Engineering Research Council of Canada under Grant No. OGP-41983.The authors would like to thank D. E. Ward for his many helpful comments.     

一类新的二阶组合切导数及其应用

引进了一种新的切锥,讨论它与相依切锥的关系.借助这种新的切锥引进了一类新的二阶组合切导数,并讨论了它与其他二阶切导数的关系.利用这类新的二阶组合切导数,建立了集值优化分别取得Henig有效元和全局有效元的最优性必要条件.     

Further relationship between second-order cone and positive semidefinite matrix cone

It is well known that second-order cone (SOC) programming can be regarded as a special case of positive semidefinite programming using the arrow matrix. This paper further studies the relationship between SOCs and positive semidefinite matrix cones. In particular, we explore the relationship to expressions regarding distance, projection, tangent cone, normal cone and the KKT system. Understanding these relationships will help us see the connection and difference between the SOC and its PSD reformulation more clearly.     

Conditional expectation of integrands and random sets

The conditional expectation of integrands and random sets is the main tool of stochastic optimization. This work wishes to make up for the lack of real synthesis about this subject. We improve the existing hypothesis and simplify the corresponding proofs. In the convex case we especially study the problem of the exchange of conditional expectation and subdifferential operators.     

A one-step smoothing Newton method for second-order cone programming

A new smoothing function for the second-order cone programming is given by smoothing the symmetric perturbed Fischer–Burmeister function. Based on this new function, a one-step smoothing Newton method is presented for solving the second-order cone programming. The proposed algorithm solves only one linear system of equations and performs only one line search at each iteration. This algorithm does not have restrictions regarding its starting point and is Q-quadratically convergent. Numerical results suggest the effectiveness of our algorithm.     

Two classes of merit functions for the second-order cone complementarity problem

Recently Tseng (Math Program 83:159–185, 1998) extended a class of merit functions, proposed by Luo and Tseng (A new class of merit functions for the nonlinear complementarity problem, in Complementarity and Variational Problems: State of the Art, pp. 204–225, 1997), for the nonlinear complementarity problem (NCP) to the semidefinite complementarity problem (SDCP) and showed several related properties. In this paper, we extend this class of merit functions to the second-order cone complementarity problem (SOCCP) and show analogous properties as in NCP and SDCP cases. In addition, we study another class of merit functions which are based on a slight modification of the aforementioned class of merit functions. Both classes of merit functions provide an error bound for the SOCCP and have bounded level sets.Member of Mathematics Division, National Center for Theoretical Sciences, Taipei Office. The author’s work is partially supported by National Science Council of Taiwan.     

First and second order optimality conditions for set-valued optimization problems

In this paper we study first and second order necessary and sufficient optimality conditions for optimization problems involving set-valued maps and we derive some known results in a more general framework.     

A second-order cone cutting surface method: complexity and application

We present an analytic center cutting surface algorithm that uses mixed linear and multiple second-order cone cuts. Theoretical issues and applications of this technique are discussed. From the theoretical viewpoint, we derive two complexity results. We show that an approximate analytic center can be recovered after simultaneously adding p second-order cone cuts in O(plog (p+1)) Newton steps, and that the overall algorithm is polynomial. From the application viewpoint, we implement our algorithm on mixed linear-quadratic-semidefinite programming problems with bounded feasible region and report some computational results on randomly generated fully dense problems. We compare our CPU time with that of SDPLR, SDPT3, and SeDuMi and show that our algorithm outperforms these software packages on problems with fully dense coefficient matrices. We also show the performance of our algorithm on semidefinite relaxations of the maxcut and Lovasz theta problems. M.R. Oskoorouchi’s work has been completed with the support of the partial research grant from the College of Business Administration, California State University San Marcos, and the University Professional Development Grant. J.E. Mitchell’s material is based upon work supported by the National Science Foundation under Grant No. 0317323. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.     

A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov–Todd step

In this paper we propose a primal-dual path-following interior-point algorithm for second-order cone optimization. The algorithm is based on a new technique for finding the search directions and the strategy of the central path. At each iteration, we use only full Nesterov–Todd step. Moreover, we derive the currently best known iteration bound for the algorithm with small-update method, namely, , where N denotes the number of second-order cones in the problem formulation and ε the desired accuracy.     

A smoothing Newton method for second-order cone optimization based on a new smoothing function

A new smoothing function is given in this paper by smoothing the symmetric perturbed Fischer-Burmeister function. Based on this new smoothing function, we present a smoothing Newton method for solving the second-order cone optimization (SOCO). The method solves only one linear system of equations and performs only one line search at each iteration. Without requiring strict complementarity assumption at the SOCO solution, the proposed algorithm is shown to be globally and locally quadratically convergent. Numerical results demonstrate that our algorithm is promising and comparable to interior-point methods.     

A Newton’s method for perturbed second-order cone programs

We develop optimality conditions for the second-order cone program. Our optimality conditions are well-defined and smooth everywhere. We then reformulate the optimality conditions into several systems of equations. Starting from a solution to the original problem, the sequence generated by Newton’s method converges Q-quadratically to a solution of the perturbed problem under some assumptions. We globalize the algorithm by (1) extending the gradient descent method for differentiable optimization to minimizing continuous functions that are almost everywhere differentiable; (2) finding a directional derivative of the equations. Numerical examples confirm that our algorithm is good for “warm starting” second-order cone programs—in some cases, the solution of a perturbed instance is hit in two iterations. In the progress of our algorithm development, we also generalize the nonlinear complementarity function approach for two variables to several variables.     

A new smoothing Newton-type method for second-order cone programming problems

A new smoothing function of the well-known Fischer–Burmeister function is given. Based on this new function, a smoothing Newton-type method is proposed for solving second-order cone programming. At each iteration, the proposed algorithm solves only one system of linear equations and performs only one line search. This algorithm can start from an arbitrary point and it is Q-quadratically convergent under a mild assumption. Numerical results demonstrate the effectiveness of the algorithm.     

Necessary second-order conditions for a weak local minimum in a problem with endpoint and control constraints

One of the first steps towards necessary second-order optimality conditions in problems with constraints was taken by Dubovitskii and Milyutin in 1965. They offered a scheme that was very effective in smooth optimization problems, but seemed to be not suitable for applications in problems with pointwise control constraints. In this article we consider a modification of the Dubovitskii–Milyutin scheme, which allows to derive necessary second-order conditions for a weak local minimum in optimal control problems with a finite number of endpoint constraints of equality and inequality type and with pointwise control constraints of inequality type given by smooth functions. Assuming that the gradients of active control constraints are linearly independent, we provide rather straightforward proof of these conditions for a measurable and essentially bounded optimal control.     

A Hausdorff-type distance,a directional derivative of a set-valued map and applications in set optimization

Abstract

In this paper, we follow Kuroiwa’s set approach in set optimization, which proposes to compare values of a set-valued objective map F with respect to various set order relations. We introduce a Hausdorff-type distance relative to an ordering cone between two sets in a Banach space and use it to define a directional derivative for F. We show that the distance has nice properties regarding set order relations and the directional derivative enjoys most properties of the one of a scalar single-valued function. These properties allow us to derive necessary and/or sufficient conditions for various types of maximizers and minimizers of F.     

Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems

By using the concepts of local cone approximations and K-directional derivatives, we obtain necessary conditions of optimality for the weak efficiency of the vectorial optimization problems with the inequalities and abstract constraints. We introduce the notion of stationary point (weak and strong) and we prove that, under suitable hypotheses of K-invexity, the stationary points are weakly efficient solutions (global).     

A necessary and sufficient condition for singular nonlinear second-order boundary value problems to have positive solutions

In this paper the following result is obtained: Suppose f(g,u,v) is nonnegative, continuous in (a, 6) ×R⁺ ×R ⁺ ; f may be singular at κ = a(and/or κ = b) and υ = 0; f is nondecreasing on u for each κ,υ,nonincreasing on υ for each κ,u; there exists a constant q ε (0,1) such that