We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 81-91 of 91 results
  1. Recent Developments on Primal–Dual Splitting Methods with Applications to Convex Minimization

    This chapter presents a survey on primal–dual splitting methods for solving monotone inclusion problems involving maximally monotone operators,...
    Radu Ioan Boţ, Ernö Robert Csetnek, Christopher Hendrich in Mathematics Without Boundaries
    Chapter 2014
  2. Keynote Iterative Methods

    In this chapter we give an introduction to the basic (sub)gradient-based methods for minimizing a convex function on a Hilbert space. We pay special...
    Chapter 2015
  3. Split Feasibility and Fixed Point Problems

    In this survey article, we present an introduction of split feasibility problems, multisets split feasibility problems and fixed point problems. The...
    Qamrul Hasan Ansari, Aisha Rehan in Nonlinear Analysis
    Chapter 2014
  4. Iteration-complexity of first-order penalty methods for convex programming

    This paper considers a special but broad class of convex programming problems whose feasible region is a simple compact convex set intersected with...

    Guanghui Lan, Renato D. C. Monteiro in Mathematical Programming
    Article 06 September 2012
  5. Zeros of Sums of Monotone Operators

    Properties of the zeros of a single monotone operator were discussed in Section 23.4. In this chapter, we first characterize the zeros of sums of...
    Heinz H. Bauschke, Patrick L. Combettes in Convex Analysis and Monotone Operator Theory in Hilbert Spaces
    Chapter 2011
  6. Templates for convex cone problems with applications to sparse signal recovery

    This paper develops a general framework for solving a variety of convex cone problems that frequently arise in signal processing, machine learning,...

    Stephen R. Becker, Emmanuel J. Candès, Michael C. Grant in Mathematical Programming Computation
    Article 30 July 2011
  7. Proximal Minimization

    As seen in Chapter 26, the solutions to variational problems can be characterized by fixed point equations involving proximity operators. Since...
    Heinz H. Bauschke, Patrick L. Combettes in Convex Analysis and Monotone Operator Theory in Hilbert Spaces
    Chapter 2011
  8. A family of projective splitting methods for the sum of two maximal monotone operators

    A splitting method for two monotone operators A and B is an algorithm that attempts to converge to a zero of the sum A  +  B by solving a sequence of...

    Jonathan Eckstein, B. F. Svaiter in Mathematical Programming
    Article 05 January 2007
  9. Self-adaptive operator splitting methods for monotone variational inequalities

    Solving a variational inequality problem VI(Ω, F ) is equivalent to finding a solution of a system of nonsmooth equations (a hard problem). The...

    Bingsheng He, Li-Zhi Liao, Shengli Wang in Numerische Mathematik
    Article 13 December 2002
  10. Auxiliary Problem Principle and Proximal Point Methods

    An extension of the auxiliary problem principle to variational inequalities with non-symmetric multi-valued operators in Hilbert spaces is studied....

    A. Kaplan, R. Tichatschke in Journal of Global Optimization
    Article 01 September 2000
  11. A Hybrid Approximate Extragradient – Proximal Point Algorithm Using the Enlargement of a Maximal Monotone Operator

    We propose a modification of the classical extragradient and proximal point algorithms for finding a zero of a maximal monotone operator in a Hilbert...

    M. V. Solodov, B. F. Svaiter in Set-Valued Analysis
    Article 01 December 1999
Did you find what you were looking for? Share feedback.