Minimizing Certain Convex Functions

DOI10.1137/0111043zbMath0128.05801OpenAlexW2017966952MaRDI QIDQ5335465

Jack Warga

Publication date: 1963

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0111043

zbMATH Keywords

differentiation and integration, measure theory

Related Items (24)

A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems ⋮ Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications ⋮ The blockwise coordinate descent method for integer programs ⋮ Randomized Block Adaptive Linear System Solvers ⋮ Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems ⋮ A projective method for structured nonlinear programs ⋮ Method of cyclic descent in the problem of best approximation ⋮ On global convergence of alternating least squares for tensor approximation ⋮ Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming ⋮ Optimal H₂ output-feedback control of sampled-data systems ⋮ Regularized Multitask Learning for Multidimensional Log-Density Gradient Estimation ⋮ A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions ⋮ A convergent overlapping domain decomposition method for total variation minimization ⋮ Approximation methods for the unconstrained optimization ⋮ A stochastic subspace approach to gradient-free optimization in high dimensions ⋮ A note on quasi convex programming ⋮ Majorization minimization by coordinate descent for concave penalized generalized linear models ⋮ Overlapping Domain Decomposition Methods for Total Variation Denoising ⋮ Über die Konvergenz von Einzelschrittverfahren zur Minimierung konvexer Funktionen. (On convergence of one-step methods for minimizing convex functions.) ⋮ A knowledge‐supported improvement of the PSO method ⋮ Unnamed Item ⋮ Nonlinear successive over-relaxation ⋮ Error bounds and convergence analysis of feasible descent methods: A general approach ⋮ A generic coordinate descent solver for non-smooth convex optimisation

This page was built for publication: Minimizing Certain Convex Functions