Results 1 to 10 of about 168 (66)
Saddle point criteria for semidefinite semi-infinite convex multiobjective optimization problems [PDF]
In this paper, we consider a nonlinear semidefinite semi-infinite convex multiobjective optimization problem where the feasible region is determined by finite number of equality and infinite number of inequality constraints.
Laha Vivek +2 more
doaj +1 more source
Prescribed energy saddle-point solutions of nonlinear indefinite problems
A minimax variational method for finding mountain pass-type solutions with prescribed energy levels is introduced. The method is based on application of the Linking Theorem to the energy-level nonlinear Rayleigh quotients which critical points ...
Yavdat Il'yasov +2 more
doaj +3 more sources
Accelerated variance-reduced methods for saddle-point problems
We consider composite minimax optimization problems where the goal is to find a saddle-point of a large sum of non-bilinear objective functions augmented by simple composite regularizers for the primal and dual variables.
Ekaterina Borodich +5 more
doaj +1 more source
A new generalized shift-splitting method for nonsymmetric saddle point problems
Recently, Huang and Huang [ Journal of Computational and Applied Mathematics , 328 (2018) 381–399] proposed a modified generalized shift-splitting preconditioned (denoted by MGSSP) method for solving large sparse saddle point problems, and gave the ...
Tao Wei, Li-Tao Zhang
doaj +1 more source
A GenEO Domain Decomposition method for Saddle Point problems
We introduce an adaptive element-based domain decomposition (DD) method for solving saddle point problems defined as a block two by two matrix. The algorithm does not require any knowledge of the constrained space.
Nataf, Frédéric +1 more
doaj +1 more source
We apply an existence theorem of variational inclusion problem on metric spaces to study optimization problems, set-valued vector saddle point problems, bilevel problems, and mathematical programs with equilibrium constraint on metric spaces.
Lin Lai-Jiu, Chuang Chih-Sheng
doaj +2 more sources
The preconditioned generalized shift-splitting (PGSS) iteration method is unconditionally convergent for solving saddle point problems with nonsymmetric coefficient matrices.
Yao Xiao, Qingbiao Wu, Yuanyuan Zhang
doaj +1 more source
Recent advances in domain decomposition methods for large-scale saddle point problems
Scalability of parallel solvers for problems with high heterogeneities relies on adaptive coarse spaces built from generalized eigenvalue problems in the subdomains.
Nataf, Frédéric +1 more
doaj +1 more source
Numerical Resolution of Fluid Dynamic Problems Using a Saddle Point Variational Formulation
Variational methods are useful for finding numerical solutions of differential equations, which are the corresponding Euler-Lagrange equations to the stationary condition of the functional. Usually the functional is a maximum or a minimum with respect to
Reginaldo Guirardello
doaj +1 more source
A modified variant of HSS preconditioner for generalized saddle point problems
Recently, Zhang [Numerical Linear Algebra with Applications, 2018: e2166] constructed an efficient variant of Hermitian and skew-Hermitian splitting (HSS) preconditioner for generalized saddle point problems, and gave the corresponding theoretical ...
Li-Tao Zhang, Yi-Fan Zhang
doaj +1 more source

