Results 41 to 50 of about 1,995,695 (219)
MathematicsIn this article, we investigate a class of non-smooth semidefinite multiobjective programming problems with inequality and equality constraints (in short, NSMPP). We establish the convex separation theorem for the space of symmetric matrices.
Balendu Bhooshan Upadhyay +2 more
doaj +1 more source
Maximality of the sum of a maximally monotone linear relation and a maximally monotone operator
, 2012 The most famous open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that Rockafellar's constraint qualification holds. In this paper, we prove the maximal monotonicity of $A+
Borwein, Jonathan M., Yao, Liangjin
core +1 more source
An extension of Yuan's Lemma and its applications in optimization [PDF]
, 2017 We prove an extension of Yuan's Lemma to more than two matrices, as long as the set of matrices has rank at most 2. This is used to generalize the main result of [A. Baccari and A. Trad.
Brown, André EX +11 more
core +2 more sources
Optimality conditions and Lagrange multipliers for shape and topology optimization problems
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2023 We discuss first order optimality conditions for geometric optimization problems with Neumann boundary conditions and boundary observation. The methods we develop here are applicable to large classes of state systems or cost functionals.
Dan Tiba
doaj +1 more source
On Constraint qualifications of a nonconvex inequality
Optimization Letters, 2017 In this paper, we study constraint qualifications for the nonconvex inequality defined by a proper lower semicontinuous function. These constraint qualifications involve the generalized construction of normal cones and subdifferentials. Several conditions for these constraint qualifications are also provided therein.
Wei, Zhou, Yao, Jen-Chih
openaire +3 more sources
Croatian Operational Research Review, 2019 In this paper we investigate a bilevel optimization problem by using the optimistic approach. Under a non smooth generalized Guignard constraint qualification, due the optimal value reformulation, the necessary optimality conditions in terms of ...
Nazih Abderrazzak Gadhi +1 more
doaj +1 more source
A constraint qualification for the dislocation hyperbolic augmented Lagrangian algorithm
Results in Control and OptimizationIn this paper, we study an augmented Lagrangian-type algorithm called the Dislocation Hyperbolic Augmented Lagrangian Algorithm (DHALA), which solves an inequality nonconvex optimization problem.
Lennin Mallma Ramirez +3 more
doaj +1 more source
Nonsingularity Conditions for FB System of Reformulating Nonlinear Second-Order Cone Programming
Abstract and Applied Analysis, 2013 This paper is a counterpart of Bi et al., 2011. For a locally optimal solution to the nonlinear second-order cone programming (SOCP), specifically, under Robinson’s constraint qualification, we establish the equivalence among the following three ...
Shaohua Pan, Shujun Bi, Jein-Shan Chen
doaj +1 more source
, 2016 The constraint qualification Q-CCCQ plays an important role in quasiconvex programming and has been developed by many authors to investigate the set containment problem, duality and optimality conditions for quasiconvex programming.
Xiaopeng Zhao
semanticscholar +1 more source
RELAXED MANGASARIAN-FROMOVITZ CONSTRAINT QUALIFICATION AND ITS APPLICATIONS
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019 Nonlinear programming problems are considered under the relaxed Mangasarian-Fromovitz constraint qualification. It was established that a new constraint qualification CRSC is another form of relaxed Mangasarian-Fromovitz constraint qualification and ...
S. V. Aktanarovich +3 more
doaj