Results 41 to 50 of about 166 (143)
Joint minimization with alternating Bregman proximity operators
, 2006 International audienceA systematic study of the proximity properties of Bregman distances is carried out. This investigation leads to the introduction of a new type of proximity operator which complements the usual Bregman proximity operator.
Combettes, Patrick, L +2 more
core +1 more source
Optimal transport of vector measures. [PDF]
Calc Var Partial Differ Equ, 2021 Ciosmak KJ.
europepmc +1 more source
Uniqueness of supporting hyperplanes and an alternative to solutions of variational inequalities
A uniqueness theorem of supporting hyperplanes for a class of convex level sets in a Hilbert space is obtained. As an application of this result, we prove an alternative theorem on solutions of variational inequalities defined on convex level sets. Three
Songnian He, Hong-Kun Xu
core +1 more source
Minimizing condition number via convex programming [PDF]
, 2011 In this paper we consider minimizing the spectral condition number of a positive semidefinite matrix over a nonempty closed convex set Ω. We show that it can be solved as a convex programming problem, and moreover, the optimal value of the latter problem
Ting Kei Pong, Zhaosong Lu
core +1 more source
A fast continuous time approach with time scaling for nonsmooth convex optimization. [PDF]
Adv Contin Discret Model, 2022 Boţ RI, Karapetyants MA.
europepmc +1 more source
Case of Non-paramonotone Operators ∗
, 2008 For variational inequalities characterizing saddle points of Lagragians associated with convex programming problems in Hilbert spaces, the convergence of an interior proximal method based on Bregman distance functionals is studied.
Variational Inequalities +2 more
core
Quotients of M-convex sets and M-convex functions [PDF]
We unify the study of quotients of matroids, polymatroids, valuated matroids and strong maps of submodular functions in the framework of Murota's discrete convex analysis.
Smith, Ben +3 more
core +1 more source
Time Rescaling of a Primal-Dual Dynamical System with Asymptotically Vanishing Damping. [PDF]
Appl Math Optim, 2023 Hulett DA, Nguyen DK.
europepmc +1 more source
, 2006 . We present a new semidefinite programming formulation of sum-of-squares representations of nonnegative polynomials, cosine polynomials and trigonometric polynomials of one variable. The parametrization is based on discrete transforms (specifically, the
Tae Roh, Lieven Vandenberghe
core
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates. [PDF]
Math Program, 2023 Boţ RI, Csetnek ER, Nguyen DK.
europepmc +1 more source