scientific article; zbMATH DE number 3574917

From MaRDI portal
Revision as of 09:59, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4144736

zbMath0368.65053MaRDI QIDQ4144736

A. Marroco, Roland Glowinski

Publication date: 1975

Full work available at URL: https://eudml.org/doc/193269

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

Continuum limit of p-Laplacian evolution problems on graphs: Lq graphons and sparse graphsMulti-step inertial strictly contractive PRSM algorithms for convex programming problems with applicationsDiscrete potential mean field games: duality and numerical resolutionMajorized iPADMM for Nonseparable Convex Minimization Models with Quadratic Coupling TermsAn augmented mixed FEM for the convective Brinkman-Forchheimer problem: \textit{a priori} and \textit{a posteriori} error analysisNew mixed finite element methods for the coupled convective Brinkman-Forchheimer and double-diffusion equationsA golden ratio proximal alternating direction method of multipliers for separable convex optimizationADMM for Penalized Quantile Regression in Big DataFully corrective gradient boosting with squared hinge: fast learning rates and early stoppingA Banach spaces-based mixed finite element method for the stationary convective Brinkman-Forchheimer problemA prediction-correction ADMM for multistage stochastic variational inequalitiesA proximal fully parallel splitting method with a relaxation factor for separable convex programmingA variable projection method for large-scale inverse problems with \(\ell^1\) regularizationA fully‐mixed finite element method for the coupling of the Navier–Stokes and Darcy–Forchheimer equationsOn convergence rates of proximal alternating direction method of multipliersA semismooth Newton based dual proximal point algorithm for maximum eigenvalue problemGeneralized damped Newton algorithms in nonsmooth optimization via second-order subdifferentialsA symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimizationComplexity analysis of a stochastic variant of generalized alternating direction method of multipliersRevisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence RatesPower law slip boundary condition for Navier-Stokes equations: discontinuous Galerkin schemesLinearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applicationsGlobally convergent coderivative-based generalized Newton methods in nonsmooth optimizationImplicit regularization effects of the Sobolev norms in image processingGlobal Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite ProgrammingA linear algebra perspective on the random multi-block ADMM: the QP caseFull Discretisation of the Time Dependent Navier-Stokes Equations with Anisotropic Slip Boundary ConditionA revisit of Chen-Teboulle's proximal-based decomposition methodConvergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimizationA new stopping criterion for Eckstein and Bertsekas's generalized alternating direction method of multipliersDiscontinuous Galerkin methods for Stokes equations under power law slip boundary condition: a priori analysisJ‐ADMM for a multi‐contact problem in electro‐elastostaticsApproximate customized proximal point algorithms for separable convex optimizationUnderstanding the convergence of the preconditioned PDHG method: a view of indefinite proximal ADMMQuasi non-negative quaternion matrix factorization with application to color face recognitionOn a fractional \(p\)-Laplacian equation with critical fractional Sobolev exponentEnhanced total variation minimization for stable image reconstructionCoupling of finite and boundary elements for singularly nonlinear transmission and contact problemsImproving image deblurringNumerical solution for a class of evolution differential equations with \(p\)-Laplacian and memoryAn error estimate for bilateral contact problem with nonmonotone friction between two electroelastic bodiesA two-stage numerical approach for the sparse initial source identification of a diffusion–advection equation *Distributionally robust Weber problem with uncertain demandExistence results for a class of local and nonlocal nonlinear elliptic problemsA relaxed proximal ADMM method for block separable convex programmingThe operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysisA partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problemsInfeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear ProgrammingStrongly convergent inertial proximal point algorithm without on-line ruleFractional elliptic problems on Lipschitz domains: regularity and approximationInexact generalized ADMM with relative error criteria for linearly constrained convex optimization problemsMultiplicity of nontrivial solutions for p‐Kirchhoff type equation with Neumann boundary conditionsOn mathematical modeling in image reconstruction and beyondUnnamed ItemDecomposition methods for global solution of mixed-integer linear programsA proximal Peaceman–Rachford splitting method for solving the multi-block separable convex minimization problemsOn inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative errorExploiting low-rank structure in semidefinite programming by approximate operator splittingModel selection with distributed SCAD penaltyA rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programmingSolving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian MethodA Spatial Color Compensation Model Using Saturation-Value Total VariationFaster Lagrangian-Based Methods in Convex OptimizationPenalized Quantile Regression for Distributed Big Data Using the Slack Variable RepresentationAn Image Registration Model in Electron Backscatter DiffractionFinite volume schemes for the p-Laplacian on Cartesian meshesA Symmetric Inertial Alternating Direction Method of Multipliers for Elliptic Equation Constrained Optimization ProblemGolden Ratio Primal-Dual Algorithm with LinesearchCyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and ApplicationsPenalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility PumpsTensor completion by multi-rank via unitary transformationProximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New TwistsAn operator-splitting approach for variational optimal control formulations for diffeomorphic shape matchingUnnamed ItemOn the Efficiency of Random Permutation for ADMM and Coordinate DescentUnnamed ItemSolvability and optimization for a class of mixed variational problemsA Privacy-Preserving Method to Optimize Distributed Resource AllocationHigh Order Edge Sensors with $\ell^1$ Regularization for Enhanced Discontinuous Galerkin MethodsSolving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction MethodsLearning the invisible: a hybrid deep learning-shearlet framework for limited angle computed tomographyHigher-order total variation approaches and generalisationsA Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and BeyondAn Inexact Dual Alternating Direction Method of Multipliers for Image Decomposition and RestorationConvergence revisit on generalized symmetric ADMMA descent SQP alternating direction method for minimizing the sum of three convex functionsNonlinear Forward-Backward Splitting with Projection CorrectionThermal flows in fractured porous mediaConservation Laws for Free-Boundary Fluid LayersAn Alternating Direction Method of Multipliers for Optimal Control Problems Constrained with Elliptic EquationsAn Alternating Direction Method of Multipliers for the Optimization Problem Constrained with a Stationary Maxwell SystemAn Optimal-Storage Approach to Semidefinite Programming Using Approximate ComplementarityTwo Symmetrized Coordinate Descent Methods Can Be $O(n^2)$ Times Slower Than the Randomized VersionDeep Nitsche Method: Deep Ritz Method with Essential Boundary ConditionsA decomposition method for convex minimization problems and its application.Numerical Methods for Power-Law Diffusion ProblemsAlternating Direction Method of Multipliers for Linear Inverse ProblemsRegularity of the solution of Darcy-Forchheimer's equationSome existence results for a class of nonlinear equations involving a duality mappingOptimization




Cites Work




This page was built for publication: