Results 1 to 10 of about 468 (73)

Relations between Abs-Normal NLPs and MPCCs. Part 1: Strong Constraint Qualifications [PDF]

open access: yesJournal of Nonsmooth Analysis and Optimization, 2021
This work is part of an ongoing effort of comparing non-smooth optimization problems in abs-normal form to MPCCs. We study the general abs-normal NLP with equality and inequality constraints in relation to an equivalent MPCC reformulation.
Lisa C. Hegerhorst-Schultchen   +2 more
doaj   +1 more source

Relations between Abs-Normal NLPs and MPCCs. Part 2: Weak Constraint Qualifications [PDF]

open access: yesJournal of Nonsmooth Analysis and Optimization, 2021
This work continues an ongoing effort to compare non-smooth optimization problems in abs-normal form to Mathematical Programs with Complementarity Constraints (MPCCs).
Lisa C. Hegerhorst-Schultchen   +2 more
doaj   +1 more source

Nondiffusive variational problems with distributional and weak gradient constraints

open access: yesAdvances in Nonlinear Analysis, 2022
In this article, we consider nondiffusive variational problems with mixed boundary conditions and (distributional and weak) gradient constraints. The upper bound in the constraint is either a function or a Borel measure, leading to the state space being ...
Antil Harbir   +3 more
doaj   +1 more source

Presolving linear bilevel optimization problems

open access: yesEURO Journal on Computational Optimization, 2021
Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization.
Thomas Kleinert   +3 more
doaj   +1 more source

Characterizations of the Solution Sets of Generalized Convex Fuzzy Optimization Problem

open access: yesOpen Mathematics, 2019
This paper provides some new characterizations of the solution sets for non-differentiable generalized convex fuzzy optimization problem. Firstly, we introduce some new generalized convex fuzzy functions and discuss the relationships among them. Secondly,
Chen Wang, Zhou Zhiang
doaj   +1 more source

Second-Order Karush-Kuhn-Tucker Optimality Conditions for Vector Problems with Continuously Differentiable Data and Second-Order Constraint Qualifications [PDF]

open access: yes, 2014
Some necessary and sufficient optimality conditions for inequality constrained problems with continuously differentiable data were obtained in the papers [I. Ginchev and V.I. Ivanov, Second-order optimality conditions for problems with C$\sp{1}$ data, J.
Ivanov, Vsevolod I.
core   +1 more source

Global Solutions to Nonconvex Optimization of 4th-Order Polynomial and Log-Sum-Exp Functions [PDF]

open access: yes, 2014
This paper presents a canonical dual approach for solving a nonconvex global optimization problem governed by a sum of fourth-order polynomial and a log-sum-exp function. Such a problem arises extensively in engineering and sciences.
Chen, Yi, Gao, David Y
core   +1 more source

Optimality and duality in set-valued optimization utilizing limit sets

open access: yesOpen Mathematics, 2018
This paper deals with optimality conditions and duality theory for vector optimization involving non-convex set-valued maps. Firstly, under the assumption of nearly cone-subconvexlike property for set-valued maps, the necessary and sufficient optimality ...
Kong Xiangyu, Zhang Yinfeng, Yu GuoLin
doaj   +1 more source

Symmetric duality for a class of multiobjective programming

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 24, Issue 9, Page 617-625, 2000., 2000
We formulate a pair of symmetric dual nondifferentiable multiobjective programming and establish appropriate duality theorems. We also show that differentiable and nondifferentiable analogues of several pairs of symmetric dual problems can be obtained as special cases of our general symmetric programs.
Xinmin Yang, Shouyang Wang, Duan Li
wiley   +1 more source

Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization [PDF]

open access: yes, 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

Home - About - Disclaimer - Privacy