Search
Search Results
-
Convergence of an augmented Lagrange algorithm for nonlinear optimizations with second-order cone constraints
An augmented Lagrange algorithm for nonlinear optimizations with second-order cone constraints is proposed based on a Löwner operator associated with...
-
Optimality and duality analysis for multiobjective interval-valued semi-infinite optimization problem having vanishing constraints
The article focuses on a semi-infinite optimization model with a disjunctive structure of the constraints. Salient examples of such problems are...
-
On the Iterative Regularization of the Lagrange Principle in Convex Optimal Control Problems for Distributed Systems of the Volterra Type with Operator Constraints
AbstractWe consider an iterative regularization of the classical optimality conditions—Lagrange’s principle and Pontryagin’s maximum principle—in...
-
A Modified Method of Resolving Functions for Game Control Problems with Integral Constraints
The authors consider linear differential games with integral constraints. Sufficient conditions for the game termination in a finite guaranteed time...
-
Pathfollowing for parametric mathematical programs with complementarity constraints
In this paper we study procedures for pathfollowing parametric mathematical programs with complementarity constraints. We present two algorithms, one...
-
-
Necessary Optimality Conditions for Interval Optimization Problems with Functional and Abstract Constraints
This work addresses interval optimization problems in which the objective function is interval-valued while the constraints are given in functional...
-
The Euler-Lagrange and Hamiltonian Inclusion Conditions in the Presence of State Constraints
This chapter concerns necessary conditions of optimality for dynamic optimization problems with pathwise state constraints, when the dynamic...
-
Improved \(L^p\)-Folland–Stein–Sobolev inequality under constraints
Hang–Wang improved the Sobolev inequality on the unit sphere under the vanishing of higher-order moments of the volume element. In this note, we...
-
-
Two Convergent Primal–Dual Hybrid Gradient Type Methods for Convex Programming with Linear Constraints
As an effective tool for convex programming, the primal–dual hybrid gradient (PDHG) method has been widely applied in science and engineering...
-
-
Local Search for Nonsmooth DC Optimization with DC Equality and Inequality Constraints
The chapter addresses the nonsmooth optimization problem with the objective function and equality and inequality constraints given by DC functions....
-
Weakening State Constraints in Optimal Control Problems
AbstractAn optimal control problem is considered in which the integral term of the functional to be minimized contains the characteristic function...
-
Variable Metric Primal-Dual Method for Convex Optimization Problems with Changing Constraints
AbstractWe propose a modified primal-dual method for general convex optimization problems with changing affine constraints. We establish convergence...
-
Necessary Optimality Conditions for Hybrid System of Variable Dimension with Intermediate Constraints
We consider an optimal control problem for a hybrid system. The continuous motion of the system alternates with discrete variations (switchings) at...
-
Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
In this paper, we propose a primal-dual path following method for nonlinear semi-infinite semi-definite programs with infinitely many convex...
-
Optimization Problems with Cone Constraints in Groups and Semigroups: An Approach Based on Image Space Analysis
In this paper, a class of optimization problems with cone constraints in groups and semigroups is investigated by exploiting the image space...
-
Kantorovich Problems with a Parameter and Density Constraints
We discuss Kantorovich problems with a parameter and density constraints. Also we give some new results on the continuity of solutions with respect...
-
A Proximal Alternating Direction Method of Multipliers for DC Programming with Structured Constraints
In this paper, we consider a class of structured DC programming, where the objective function is the difference of two (possibly nonsmooth) convex...
