scientific article

Publication date: 13 November 2015

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

algorithms convex optimization mathematical programming

Numerical mathematical programming methods (65K05) Convex programming (90C25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems, An Algorithm to Construct Subsolutions of Convex Optimal Control Problems, Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems, A convex optimization approach to dynamic programming in continuous state and action spaces, Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation, Robust pooling for contracting models with asymmetric information, Accelerated proximal gradient method for bi-modulus static elasticity, A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints, Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces, Finite-horizon covariance control for discrete-time stochastic linear systems subject to input constraints, Equal risk pricing and hedging of financial derivatives with convex risk measures, A simplified view of first order methods for optimization, Improved linear regression prediction by transfer learning, The developments of proximal point algorithms, Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution, Adaptive Sampling Strategies for Stochastic Optimization, A regularized alternating least-squares method for minimizing a sum of squared Euclidean norms with rank constraint, The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems, Sufficient conditions for existence of global minimizers of functions on Hilbert spaces, Distributed algorithms for convex problems with linear coupling constraints, Predictive online convex optimization, Diffusion generated methods for denoising target-valued images, First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems, Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee, Computing shadow prices with multiple Lagrange multipliers, Two fast variance-reduced proximal gradient algorithms for SMVIPs -- stochastic mixed variational inequality problems with suitable applications to stochastic network games and traffic assignment problems, Combining approximation and exact penalty in hierarchical programming, Lagrange dual bound computation for stochastic service network design, Nonlocal Games with Noisy Maximally Entangled States are Decidable, A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems, A new minimizing-movements scheme for curves of maximal slope, Yosida-regularization based differential equation approach to generalized equations with applications to nonlinear convex programming, Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators, Randomness and permutations in coordinate descent methods, Towards an efficient augmented Lagrangian method for convex quadratic programming, Stochastic first-order methods for convex and nonconvex functional constrained optimization, Global optimization for non-convex programs via convex proximal point method, Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points, Active Set Complexity of the Away-Step Frank--Wolfe Algorithm, Why random reshuffling beats stochastic gradient descent, Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods, A primal-dual optimization strategy for elliptic partial differential equations, Convergence of Newton-MR under Inexact Hessian Information, On convergence rates of game theoretic reinforcement learning algorithms, Level-set methods for convex optimization, Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods, Optimization Methods for Large-Scale Machine Learning, Networked Systems Theory: Distributed Algorithms for Optimal Cooperation of Dynamical Systems, Frank-Wolfe and friends: a journey into projection-free first-order optimization methods, Smooth strongly convex interpolation and exact worst-case performance of first-order methods, Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice, Tighter McCormick relaxations through subgradient propagation, Generalized polyhedral convex optimization problems, Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions, Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches, Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion, Multiscale analysis of singularly perturbed finite dimensional gradient flows: the minimizing movement approach, Proximal algorithms and temporal difference methods for solving fixed point problems, Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations, Analysis of Optimization Algorithms via Integral Quadratic Constraints: Nonstrongly Convex Problems, An iterative dynamic programming approach for the temporal knapsack problem, Robust stochastic optimization with convex risk measures: a discretized subgradient scheme, Multi-stage distributionally robust optimization with risk aversion, Nash bargaining solution based rendezvous guidance of unmanned aerial vehicles, Incremental without replacement sampling in nonconvex optimization, Low-Rank Spectral Optimization via Gauge Duality, A representation of generalized convex polyhedra and applications, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, Sparse group fused Lasso for model segmentation: a hybrid approach, Profit-based churn prediction based on minimax probability machines, Adjacency-based regularization for partially ranked data with non-ignorable missing, Iterative Proportional Scaling Revisited: A Modern Optimization Perspective, Distributed decision-coupled constrained optimization via proximal-tracking, ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?, Asynchronous networked aggregative games, An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration, The Standard Pessimistic Bilevel Problem, A feasibility-ensured Lagrangian heuristic for general decomposable problems, Adaptive optimization with periodic dither signals, A Derivative-Free Method for Structured Optimization Problems, Convex optimization with an interpolation-based projection and its application to deep learning, Optimal sensor placement for joint parameter and state estimation problems in large-scale dynamical systems with applications to thermo-mechanics, Convergence Rate of Incremental Gradient and Incremental Newton Methods, SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD, Quasi-convex feasibility problems: subgradient methods and convergence rates, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Optimum Experimental Design for Interface Identification Problems, Power control for multi-sensor remote state estimation over interference channel, Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems, Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity, Curiosities and counterexamples in smooth convex optimization, On electricity market equilibria with storage: modeling, uniqueness, and a distributed ADMM, Two structure-preserving time discretizations for gradient flows, A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes, Active channel sparsification: realizing frequency-division duplexing massive MIMO with minimal overhead, A globally convergent incremental Newton method, On the Convergence Rate of Incremental Aggregated Gradient Algorithms, Avoiding bad steps in Frank-Wolfe variants, A Noise-Tolerant Quasi-Newton Algorithm for Unconstrained Optimization, Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization, A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods, Block coordinate type methods for optimization and learning, Augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem, A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems, Lyapunov stability of the subgradient method with constant step size, A unified primal-dual algorithm framework for inequality constrained problems, An adaptive sampling augmented Lagrangian method for stochastic optimization with deterministic constraints, Augmented Lagrangian tracking for distributed optimization with equality and inequality coupling constraints, Dealing with infeasibility in multi-parametric programming for application to explicit model predictive control, Primal-dual \(\varepsilon\)-subgradient method for distributed optimization, Graded damage in quasi‐brittle solids, Explicit expressions and computational methods for the Fortet-Mourier distance of positive measures to finite weighted sums of Dirac measures, An asynchronous subgradient-proximal method for solving additive convex optimization problems, Learning with risks based on M-location, Distributed delayed dual averaging for distributed optimization over time-varying digraphs, A distributed proximal gradient method with time-varying delays for solving additive convex optimizations, Scenario decomposable subgradient projection method for two-stage stochastic programming with convex risk measures, Static feedback design in linear discrete-time control systems based on training examples, On forward sufficient dimension reduction for categorical and ordinal responses, An elementary approach to tight worst case complexity analysis of gradient based methods, Resolvent splitting for sums of monotone operators with minimal lifting, A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program, Constrained Optimization in the Presence of Noise, An oracle-based framework for robust combinatorial optimization, Sharper Bounds for Proximal Gradient Algorithms with Errors, Basic Convex Analysis in Metric Spaces with Bounded Curvature, An information-theoretic approach to partially identified auction models, On some similarity of finite sets (and what we can say today about certain old problem), Splitting proximal with penalization schemes for additive convex hierarchical minimization problems, Distributed optimization with inexact oracle