Results 1 to 10 of about 291 (69)
Some new properties of the Lagrange function and its applications [PDF]
Fixed Point Theory and Applications, 2012 Using a dual problem in Wolfe type, the Lagrange function of an inequality constrained nonconvex programming problem is proved to be constant not only on its optimal solution set but also on a wider set.
Do Sang Kim, T. Son
semanticscholar +3 more sources
Attouch-Théra Duality, Generalized Cycles, and Gap Vectors [PDF]
SIAM Journal on Optimization, 2021 Using the Attouch-Théra duality, we study the cycles, gap vectors and fixed point sets of compositions of proximal mappings. Sufficient conditions are given for the existence of cycles and gap vectors.
Salihah Alwadani +2 more
semanticscholar +1 more source
Nonlinear Engineering, 2023 This article develops duality principles, a related convex dual formulation and primal dual formulations suitable for the local and global optimization of non convex primal formulations for a large class of models in physics and engineering.
Botelho Fabio Silva
doaj +1 more source
Lagrangian methods for optimal control problems governed by quasi-hemivariational inequalities
Miskolc Mathematical Notes, 2020 The aim of this paper is to study an optimal control problem governed by a quasihemivariational inequality by using nonlinear Lagrangian methods.
Feng-Shan Long, Biao Zeng
semanticscholar +1 more source
Symmetric duality for a higher-order nondifferentiable multiobjective programming problem
Journal of Inequalities and Applications, 2015 In this paper, a pair of Wolfe type higher-order nondifferentiable symmetric dual programs over arbitrary cones has been studied and then well-suited duality relations have been established considering K-F convexity assumptions.
I. P. Debnath +2 more
semanticscholar +2 more sources
Duality for semi-infinite programming problems involving (Hp,r)-invex functions
Journal of Inequalities and Applications, 2013 The present paper is framed to study weak, strong and strict converse duality relations for a semi-infinite programming problem and its Wolfe and Mond-Weir-type dual programs under generalized (Hp,r)-invexity.MSC:90C32, 49K35, 49N15.
Anurag Jayswal +3 more
semanticscholar +2 more sources
Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization [PDF]
, 2015 In this paper we analyze several inexact fast augmented Lagrangian methods for solving linearly constrained convex optimization problems. Mainly, our methods rely on the combination of excessive-gap-like smoothing technique developed in [15] and the ...
Necoara, Ion +2 more
core +3 more sources
Exact duality in semidefinite programming based on elementary reformulations [PDF]
, 2015 In semidefinite programming (SDP), unlike in linear programming, Farkas' lemma may fail to prove infeasibility. Here we obtain an exact, short certificate of infeasibility in SDP by an elementary approach: we reformulate any semidefinite system of the ...
Liu, Minghui, Pataki, Gabor
core +3 more sources
Journal of Inequalities and Applications, 2012 A higher-order dual for a non-differentiable minimax fractional programming problem is formulated. Using the generalized higher-order η-convexity assumptions on the functions involved, weak, strong and strict converse duality theorems are established in ...
I. Ahmad, I. Ahmad
semanticscholar +1 more source
Optimal pricing for optimal transport [PDF]
, 2014 Suppose that $c(x,y)$ is the cost of transporting a unit of mass from $x\in X$ to $y\in Y$ and suppose that a mass distribution $\mu$ on $X$ is transported optimally (so that the total cost of transportation is minimal) to the mass distribution $\nu$ on $
Bartz, Sedi, Reich, Simeon
core +1 more source