Interior-Point Algorithms for a Class of Convex Optimization Problems
Goran Lešaja, Verlynda N. Slaughter (2009)
The Yugoslav Journal of Operations Research
Similarity:
Goran Lešaja, Verlynda N. Slaughter (2009)
The Yugoslav Journal of Operations Research
Similarity:
Liping Liu, Pekka Neittaanmäki, Michal Křížek (2000)
Applications of Mathematics
Similarity:
We examine new second-order necessary conditions and sufficient conditions which characterize nondominated solutions of a generalized constrained multiobjective programming problem. The vector-valued criterion function as well as constraint functions are supposed to be from the class . Second-order optimality conditions for local Pareto solutions are derived as a special case.
I. Czochralska (1982)
Applicationes Mathematicae
Similarity:
Surjeet Kaur Suneja, Pooja Louhan (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper we give necessary and sufficient optimality conditions for a vector optimization problem over cones involving support functions in objective as well as constraints, using cone-convex and other related functions. We also associate a unified dual to the primal problem and establish weak, strong and converse duality results. A number of previously studied problems appear as special cases.
Matus Benko, Helmut Gfrerer (2016)
Kybernetika
Similarity:
We propose an SQP algorithm for mathematical programs with complementarity constraints which solves at each iteration a quadratic program with linear complementarity constraints. We demonstrate how strongly M-stationary solutions of this quadratic program can be obtained by an active set method without using enumeration techniques. We show that all limit points of the sequence of iterates generated by our SQP method are at least M-stationary.
Leo Liberti (2009)
RAIRO - Operations Research
Similarity:
A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts...
I. Czochralska (1982)
Applicationes Mathematicae
Similarity: