Proximal minimization algorithm with \(D\)-functions
From MaRDI portal
Publication:1321192
DOI10.1007/BF00940051zbMath0794.90058MaRDI QIDQ1321192
Yair Censor, Stavros A. Zenios
Publication date: 27 April 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
90C30: Nonlinear programming
Related Items
A characterization of the optimal set of linear programs based on the augmented lagrangian, Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization, Newton-type Methods with Generalized Distances For Constrained Optimization, On a proximal point method for convex optimization in banach spaces, An Extension of the Auxiliary Problem Principle to Nonsymmetric Auxiliary Operators, Strict convex regularizations, proximal points and augmented lagrangians, Non-Convex feasibility problems and proximal point methods, A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗, Interval underrelaxed bregman's method with an application, A new accuracy criterion for approximate proximal point algorithms, On the convergence of the exponential multiplier method for convex programming, Progressive regularization of variational inequalities and decomposition algorithms, An interior point method with Bregman functions for the variational inequality problem with paramonotone operators, Approximate iterations in Bregman-function-based proximal algorithms, Data parallel computing for network-structured optimization problems, Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations, A multiprojection algorithm using Bregman projections in a product space, An interior point method for the nonlinear complementarity problem, Equilibrium programming using proximal-like algorithms, On some properties of generalized proximal point methods for variational inequalities, Approximation of linear programs by Bregman's \(D_F\) projections, Some properties of generalized proximal point methods for quadratic and linear programming, Solving multistage stochastic network programs on massively prallel computers, An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities, Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs, INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES, Proximal Methods with Penalization Effects in Banach Spaces
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
