相关论文: Characterizations of the Aubin Property of the Sol…

We consider semilinear parabolic optimal control problems subject to Neumann boundary conditions, control constraints, and an infinite time horizon. The control constraints are pointwise in time, but they can be pointwise or integral in the…

The main goal of this paper is to investigate strong duality of non-convex semidefinite programming problems (SDPs). In the optimization community, it is well-known that a convex optimization problem satisfies strong duality if the Slater's…

Nonlinearly constrained nonconvex and nonsmooth optimization models play an increasingly important role in machine learning, statistics and data analytics. In this paper, based on the augmented Lagrangian function we introduce a flexible…

In the recent paper of Giorgi, Jim\'enez and Novo (J Optim Theory Appl 171:70--89, 2016), the authors introduced the so-called approximate Karush-Kuhn-Tucker (AKKT) condition for smooth multiobjective optimization problems and obtained some…

The presence of Lipschitzian properties for solution mappings associated with nonlinear parametric optimization problems is desirable in the context of stability analysis or bilevel optimization. An example of such a Lipschitzian property…

This paper is devoted to second-order variational analysis of a rather broad class of extended-real-valued piecewise liner functions and their applications to various issues of optimization and stability. Based on our recent explicit…

The trust-region problem, which minimizes a nonconvex quadratic function over a ball, is a key subproblem in trust-region methods for solving nonlinear optimization problems. It enjoys many attractive properties such as an exact…

In this paper, we study the Sobolev regularity of solutions to nonlinear second order elliptic equations with super-linear first-order terms on Riemannian manifolds, complemented with Neumann boundary conditions, when the source term of the…

This paper introduces a novel approach to evaluating the asymptotic stability of equilibrium points in both continuous-time (CT) and discrete-time (DT) nonlinear autonomous systems. By utilizing indirect Lyapunov methods and linearizing…

This paper addresses the following three topics: positive semidefinite (psd) matrix completions, universal rigidity of frameworks, and the Strong Arnold Property (SAP). We show some strong connections among these topics, using semidefinite…

Cubic-regularized Newton's method (CR) is a popular algorithm that guarantees to produce a second-order stationary solution for solving nonconvex optimization problems. However, existing understandings of the convergence rate of CR are…

A series of basic qualitative properties of the minimum sum-of-squares clustering problem are established in this paper. Among other things, we clarify the solution existence, properties of the global solutions, characteristic properties of…

We study the regularity of the solutions of second order boundary value problems on manifolds with boundary and bounded geometry. We first show that the regularity property of a given boundary value problem $(P, C)$ is equivalent to the…

This paper presents the Lagrangian duality theory for mixed-integer semidefinite programming (MISDP). We derive the Lagrangian dual problem and prove that the resulting Lagrangian dual bound dominates the bound obtained from the continuous…

The real-time solution of parametric optimization problems is critical for applications that demand high accuracy under tight real-time constraints, such as model predictive control. To this end, this work presents a learning-based…

Optimality conditions are central to analysis of optimization problems, characterizing necessary criteria for local minima. Formalizing the optimality conditions within the type-theory-based proof assistant Lean4 provides a precise, robust,…

An uniform LP duality is an useful property of conic matrix systems. A consistent linear conic optimization problem yields uniform LP duality if for any linear cost function, for which the primal problem has finite optimal value, the…

This paper provides necessary and sufficient optimality conditions for abstract constrained mathematical programming problems in locally convex spaces under new qualification conditions. Our approach exploits the geometrical properties of…

When the objective function is not locally Lipschitz, constraint qualifications are no longer sufficient for Karush-Kuhn-Tucker (KKT) conditions to hold at a local minimizer, let alone ensuring an exact penalization. In this paper, we…

In this paper we consider a broad class of infinite horizon discrete-time optimal control models that involve a nonnegative cost function and an affine mapping in their dynamic programming equation. They include as special cases classical…