Computational Optimization 1999
DOI: 10.1007/978-1-4615-5197-3_3
|View full text |Cite
|
Sign up to set email alerts
|

A Logarithmic-Quadratic Proximal Method for Variational Inequalities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
115
0
3

Year Published

1999
1999
2021
2021

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 50 publications
(119 citation statements)
references
References 11 publications
1
115
0
3
Order By: Relevance
“…This kind of discrepancies is actually currently used in the convex optimization literature and may be seen a regularized log-proximal method (see for instance Ausslender et al [1]). The resulting optimization algorithm leads to efficient tractable interior point solutions even when the number of constraint is large.…”
Section: Quasi-kullback or Log-proximal Divergencementioning
confidence: 99%
See 2 more Smart Citations
“…This kind of discrepancies is actually currently used in the convex optimization literature and may be seen a regularized log-proximal method (see for instance Ausslender et al [1]). The resulting optimization algorithm leads to efficient tractable interior point solutions even when the number of constraint is large.…”
Section: Quasi-kullback or Log-proximal Divergencementioning
confidence: 99%
“…In Hjort et al [24], convergence of empirical likelihood is investigated when q is allowed to increase with n. They show that convergence to a χ 2 distribution still holds when q = O(n 1 3 ) as n tends to infinity.…”
Section: Remarkmentioning
confidence: 99%
See 1 more Smart Citation
“…Examples of these regularizing functionals are the Bregman distances (see, e.g. [1,8,13,14,20,25]), ϕ-divergences ( [26,5,15,18,19,27,28]) and log-quadratic regularizations ( [3,4]). Being interior point methods, it is a basic assumption that the topological interior of C is nonempty.…”
Section: Introductionmentioning
confidence: 99%
“…So, if C = ∅, it holds C ⊂ int C k and hence a regularizing functional can be associated with the set C k . Denote by d k the regularization functional proposed in [3,4] (associated with the set C k with non-empty interior) and by ∇ 1 d k the derivative of d k with respect to its first argument. The subproblems in [29] find an approximate solution x k ∈ int C k of the inclusion where λ k > 0, ∂ ε f is the ε-subdifferential of f [6].…”
Section: Introductionmentioning
confidence: 99%