Results 91 to 100 of about 162 (141)

Determinantmaxrmin Tion Of A Nonsymmetric Matrix With Quadratic Constraints

open access: yes, 2002
This paper presents the problem of maximizing the determinant of a K-square real matrix B, subject to the constraint that each row b k of B satisfies b 1, where # 1 ,...,# K , are K given real symmetric positive definite matrices.
Abdelhamid Zaïdi   +2 more
core  

Saddle Points and Pareto Points in Multiple Objective Programming

open access: yes, 2007
In this paper relationships between Pareto points and saddle points in multiple objective programming are investigated. Convex and nonconvex problems are considered and the equivalence between Pareto points and saddle points is proved in both cases.
Matthias Ehrgott, Margaret M. Wiecek
core  

Using the Primal Dual Infeasible Newton Method in the Analytic Center Method for Problems Defined by Deep Cutting Planes.

open access: yes, 1998
The convergence and the complexity of a primal-dual column generation and cutting plane algorithm from approximate analytic centers for solving convex feasibility problems defined by a "deep cut" separation oracle is studied.
Faranak Sharifi-Mokhtarian   +1 more
core  

Constrained consensus-based optimization and numerical heuristics for the few particle regime. [PDF]

open access: yesJ Glob Optim
Beddrich J   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy