Results 21 to 30 of about 162 (63)
Optimal information disclosure: A linear programming approach
An uninformed sender designs a mechanism that discloses information about her type to a privately informed receiver, who then decides whether to act. I impose a single‐crossing assumption, so that the receiver with a higher type is more willing to act.
Anton Kolotilin
wiley +1 more source
This paper is aimed at providing three versions to solve and characterize weak solutions for Dirichlet problems involving the p‐Laplacian and the p‐pseudo‐Laplacian. In this way generalized versions for some results which use Ekeland variational principle, critical points for nondifferentiable functionals, and Ghoussoub‐Maurey linear principle have ...
Irina Meghea, Khalil Ezzinbi
wiley +1 more source
A Line‐Search‐Based Partial Proximal Alternating Directions Method for Separable Convex Optimization
We propose an appealing line‐search‐based partial proximal alternating directions (LSPPAD) method for solving a class of separable convex optimization problems. These problems under consideration are common in practice. The proposed method solves two subproblems at each iteration: one is solved by a proximal point method, while the proximal term is ...
Yu-hua Zeng +3 more
wiley +1 more source
Generalized Derivatives and Optimality Conditions in Nonconvex Optimization
In this paper, we study the radial epiderivative notion for nonconvex functions, which extends the (classical) directional derivative concept. The paper presents new definition and new properties for this notion and establishes relationships between the ...
Gulcin Dinc Yalcin, Refail Kasimbeyli
semanticscholar +1 more source
In this work, it is demonstrated that the cycle consistency loss and latent regression loss in CycleGAN‐based image translation models can be detrimental to image quality. The optimization scheme of CycleGAN‐based image translation systems is redesigned and a new translation model named HQ‐I2IT is proposed.
Yipeng Zhang +5 more
wiley +1 more source
Second-order conditions for spatio-temporally sparse optimal control via second subderivatives [PDF]
Nicolas Borchard, Gerd Wachsmuth
openalex +1 more source
Non-convex semi-infinite min-max optimization with noncompact sets
In this paper, first we study the non-convex sup-type functions with noncompact sets. Under quite mild conditions, the expressions of its derivative and subderivative along arbitrary direction are given.
Mei-xia Li, Changyu Wang, B. Qu
semanticscholar +1 more source
Multi-Task Learning for Compositional Data via Sparse Network Lasso. [PDF]
Okazaki A, Kawano S.
europepmc +1 more source
Matrix Linear Discriminant Analysis. [PDF]
Hu W, Shen W, Zhou H, Kong D.
europepmc +1 more source
An Elementary Introduction to Information Geometry. [PDF]
Nielsen F.
europepmc +1 more source

