Related papers: A simple proof of second-order sufficient optimali…
Sequential optimality conditions play an important role in constrained optimization since they provide necessary conditions without requiring constraint qualifications (CQs). This paper introduces a second-order extension of the Approximate…
The well known constant rank constraint qualification [Math. Program. Study 21:110--126, 1984] introduced by Janin for nonlinear programming has been recently extended to a conic context by exploiting the eigenvector structure of the…
The second-order cone plays an important role in convex optimization and has strong expressive abilities despite its apparent simplicity. Second-order cone formulations can also be solved more efficiently than semidefinite programming in…
Second-order optimality conditions are essential for nonsmooth optimization, where both the objective and constraint functions are Lipschitz continuous and second-order directionally differentiable. This paper provides no-gap second-order…
In this paper, we derive explicit second-order necessary and sufficient optimality conditions of a local minimizer to an optimal control problem for a quasilinear second-order partial differential equation with a piecewise smooth but not…
In this paper, we present some second-order sufficient conditions in terms of the Demyanov-Pevnyi's second-order directional derivatives for efficiency of $C^1$ vector optimization problems with constraints. Our results improve and…
In this paper, we analyze optimal control problems governed by semilinear parabolic equations. Box constraints for the controls are imposed and the cost functional involves the state and possibly a sparsity-promoting term, but not a…
This paper concerns the tilt stability of local optimal solutions to a class of nonlinear semidefinite programs, which involves a twice continuously differentiable objective function and a convex feasible set. By leveraging the second…
This paper focuses on second-order necessary optimality conditions for constrained optimization problems on Banach spaces. For problems in the classical setting, where the objective function is $C^2$-smooth, we show that strengthened…
We consider linear optimization over a fixed compact convex feasible region that is semi-algebraic (or, more generally, "tame"). Generically, we prove that the optimal solution is unique and lies on a unique manifold, around which the…
In this manuscript, we consider a control system governed by a general ordinary differential equation on a Riemannian manifold, with its endpoints satisfying some inequalities and equalities, and its control constrained to a closed convex…
In [R. Andreani, G. Haeser, L. M. Mito, H. Ram\'irez C., Weak notions of nondegeneracy in nonlinear semidefinite programming, arXiv:2012.14810, 2020] the classical notion of nondegeneracy (or transversality) and Robinson's constraint…
In a previous paper [R. Andreani, G. Haeser, L. M. Mito, H. Ram\'irez, T. P. Silveira. First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition. Mathematical…
In this article we study optimal control problems for systems that are affine with respect to some of the control variables and nonlinear in relation to the others. We consider finitely many equality and inequality constraints on the…
Second-order necessary conditions for optimal control problems are considered, where the ``second-order" is in the sense of that Pontryagin's maximum principle is viewed as a first-order necessary optimality condition. A sufficient…
In this paper we consider the minimization of a continuous function that is potentially not differentiable or not twice differentiable on the boundary of the feasible region. By exploiting an interior point technique, we present first- and…
Some classic second-order sufficient optimality conditions in the calculus of variations are shown to be equivalent, while also introducing a new equivalent second-order condition which is extremely easy to apply: simply integrate a linear…
The second-order cone is a class of simple convex cones and optimizing over them can be done more efficiently than with semidefinite programming. It is interesting both in theory and in practice to investigate which convex cones admit a…
The numerical performance of algorithms can be studied using test sets or procedures that generate such problems. This paper proposes various methods for generating linear, semidefinite, and second-order cone optimization problems.…
We consider nonlinear optimization problems with cardinality constraints. Based on a continuous reformulation we introduce second order necessary and sufficient optimality conditions. Under such a second order condition, we can guarantee…