Dual Direction Methods for Function Minimization

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-07165-2_40
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Pattern Search Methods for Linearly Constrained Minimization

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2000English

A Dual Split Bregman Method for Fast $\Ell ^1$ Minimization

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2013English

Deterministic and Stochastic Primal-Dual Subgradient Algorithms for Uniformly Convex Minimization

Stochastic Systems
2014English

Fast Exact and Heuristic Methods for Role Minimization Problems

2008English

Newton Methods for Large-Scale Linear Equality-Constrained Minimization

1990English

Risk Minimization Methods for Loading Dangerous Goods Into Tanker Trains

Czasopismo Techniczne
2019English

Operational Methods for Minimization of Energy Consumption of Manufacturing Equipment

International Journal of Production Research
IndustrialManufacturing EngineeringStrategyManagement ScienceManagementOperations Research
2007English

Alternating Direction Methods on Multiprocessors

SIAM Journal on Scientific and Statistical Computing
1987English

Regularized Gradient-Projection Methods for Equilibrium and Constrained Convex Minimization Problems

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy