Proximal minimization algorithm with \(D\)-functions
From MaRDI portal
Publication:1321192
DOI10.1007/BF00940051zbMath0794.90058OpenAlexW2004304255MaRDI QIDQ1321192
Stavros A. Zenios, Yair Censor
Publication date: 27 April 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00940051
Related Items
On the linear convergence of a Bregman proximal point algorithm ⋮ Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant ⋮ Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier ⋮ Sinkhorn Algorithm for Lifted Assignment Problems ⋮ First-order methods for convex optimization ⋮ Entropic Trust Region for Densest Crystallographic Symmetry Group Packings ⋮ Bregman proximal point type algorithms for quasiconvex minimization ⋮ The Generalized Bregman Distance ⋮ Interior Proximal Methods for equilibrium programming: part II ⋮ Dual convergence of the proximal point method with Bregman distances for linear programming ⋮ A new accuracy criterion for approximate proximal point algorithms ⋮ An entropic Landweber method for linear ill-posed problems ⋮ An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels ⋮ Modern regularization methods for inverse problems ⋮ Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework ⋮ A class of nonlinear proximal point algorithms for variational inequality problems ⋮ Data parallel computing for network-structured optimization problems ⋮ The proximal point method with a vectorial Bregman regularization in multiobjective DC programming ⋮ Proximal Methods with Penalization Effects in Banach Spaces ⋮ Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization ⋮ A proximal method with logarithmic barrier for nonlinear complementarity problems ⋮ Strict convex regularizations, proximal points and augmented lagrangians ⋮ Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs ⋮ Generalized proximal-type methods for weak vector variational inequality problems in Banach spaces ⋮ A characterization of the optimal set of linear programs based on the augmented lagrangian ⋮ Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations ⋮ A multiprojection algorithm using Bregman projections in a product space ⋮ Some properties of generalized proximal point methods for quadratic and linear programming ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ Optimal complexity and certification of Bregman first-order methods ⋮ A weighted mirror descent algorithm for nonsmooth convex optimization problem ⋮ A simplified view of first order methods for optimization ⋮ A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗ ⋮ The developments of proximal point algorithms ⋮ Regularizing with Bregman--Moreau Envelopes ⋮ An interior point method for the nonlinear complementarity problem ⋮ Moreau's decomposition in Banach spaces ⋮ Approximating zeros of monotone operators by proximal point algorithms ⋮ Equilibrium programming using proximal-like algorithms ⋮ The Bregman Proximal Average ⋮ Proximal methods in reflexive Banach spaces without monotonicity ⋮ Solving multistage stochastic network programs on massively prallel computers ⋮ First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems ⋮ An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities ⋮ Interior point methods for equilibrium problems ⋮ On some properties of generalized proximal point methods for variational inequalities ⋮ An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming ⋮ A simple convergence analysis of Bregman proximal gradient algorithm ⋮ An interior proximal method for a class of quasimonotone variational inequalities ⋮ Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming ⋮ Operator splittings, Bregman methods and frame shrinkage in image processing ⋮ Iterative approaches to find zeros of maximal monotone operators by hybrid approximate proximal point methods ⋮ The Legendre Transformation in Modern Optimization ⋮ Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings ⋮ Interval underrelaxed bregman's method with an application ⋮ Testing and non-linear preconditioning of the proximal point method ⋮ Interior proximal methods for quasiconvex optimization ⋮ Rescaled proximal methods for linearly constrained convex problems ⋮ A characterization of proximity operators ⋮ Bregman Itoh-Abe methods for sparse optimisation ⋮ Alternating minimization as sequential unconstrained minimization: a survey ⋮ Maximal monotone operators and the proximal point algorithm in the presence of computational errors ⋮ Convergence of a proximal point algorithm for solving minimization problems ⋮ An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems ⋮ An extension of the proximal point algorithm with Bregman distances on Hadamard manifolds ⋮ An asymmetric proximal decomposition method for convex programming with linearly coupling constraints ⋮ A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors ⋮ Higher order convergence rates for Bregman iterated variational regularization of inverse problems ⋮ Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization ⋮ Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming ⋮ Newton-type Methods with Generalized Distances For Constrained Optimization ⋮ Proximal-like algorithm using the quasi D-function for convex second-order cone programming ⋮ Generalized Bregman envelopes and proximity operators ⋮ Interior proximal method without the cutting plane property ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ Generalized proximal point algorithms for multiobjective optimization problems ⋮ A generalized proximal-point-based prediction-correction method for variational inequality problems ⋮ A new generalized APPA for maximal monotone operators ⋮ Block‐iterative algorithms ⋮ On the existence and convergence of approximate solutions for equilibrium problems in Banach spaces ⋮ On a proximal point method for convex optimization in banach spaces ⋮ On the convergence of the exponential multiplier method for convex programming ⋮ An Extension of the Auxiliary Problem Principle to Nonsymmetric Auxiliary Operators ⋮ Inertial alternating generalized forward-backward splitting for image colorization ⋮ Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces ⋮ Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints ⋮ Approximate generalized proximal-type method for convex vector optimization problem in Banach spaces ⋮ INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES ⋮ Proximal methods for nonlinear programming: Double regularization and inexact subproblems ⋮ A new family of penalties for augmented Lagrangian methods ⋮ Non-Convex feasibility problems and proximal point methods ⋮ On a generalized proximal point method for solving equilibrium problems in Banach spaces ⋮ A proximal point algorithm with a ϕ-divergence for quasiconvex programming ⋮ Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization ⋮ EM Algorithms ⋮ An interior point-proximal method of multipliers for convex quadratic programming ⋮ Double-regularization proximal methods, with complementarity applications ⋮ Interior proximal methods and central paths for convex second-order cone programming ⋮ Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment ⋮ Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming ⋮ Mass-spring-damper networks for distributed optimization in non-Euclidean spaces ⋮ Accelerated Bregman proximal gradient methods for relatively smooth convex optimization ⋮ Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity ⋮ Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming ⋮ Progressive regularization of variational inequalities and decomposition algorithms ⋮ A proximal point algorithm with asymmetric linear term ⋮ On a Bregman regularized proximal point method for solving equilibrium problems ⋮ A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption ⋮ On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity ⋮ An interior point method with Bregman functions for the variational inequality problem with paramonotone operators ⋮ Approximate iterations in Bregman-function-based proximal algorithms ⋮ A proximity moving horizon estimator for a class of nonlinear systems ⋮ Approximation of linear programs by Bregman's \(D_F\) projections ⋮ The indefinite proximal point algorithms for maximal monotone operators ⋮ Lagrangian transformation and interior ellipsoid methods in convex optimization ⋮ Interior proximal methods for equilibrium programming: part I
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiplicative iterative algorithms for convex programming
- Optimization of Burg's entropy over linear constraints
- Parallel computing with block-iterative image reconstruction algorithms
- The primal-dual algorithm as a constraint-set-manipulation device
- A relaxed version of Bregman's method for convex programming
- An algorithm for maximizing entropy subject to simple bounds
- Quadratically constrained minimum cross-entropy analysis
- Monotone (nonlinear) operators in Hilbert space
- An iterative row-action method for interval convex programming
- On Block-Iterative Entropy Maximization
- Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
This page was built for publication: Proximal minimization algorithm with \(D\)-functions
