A decomposition/synchronization scheme for formulating and solving optimization problems

A decomposition/synchronization scheme for formulating and solving optimization problems

Large-scale optimization problems, even when convex, can be challenging to solve directly. Recently, a considerable amount of research has focused on developing methods for solving such optimization problems in a distributed manner. The assumption that is usually made is that the global objective fu...

Bibliografske podrobnosti
Main Authors:	Anderson, J, Papachristodoulou, A
Format:	Journal article
Jezik:	English
Izdano:	2009

Podobne knjige/članki

A Decomposition Technique for Nonlinear Dynamical System Analysis.
od: Anderson, J, et al.
Izdano: (2012)

Dynamical system decomposition for efficient, sparse analysis.
od: Anderson, J, et al.
Izdano: (2010)

A Space Decomposition-Based Deterministic Algorithm for Solving Linear Optimization Problems
od: Gerardo L. Febres
Izdano: (2019-08-01)

HUBO formulations for solving the eigenvalue problem
od: Kyungtaek Jun, et al.
Izdano: (2023-06-01)

Solving Intractable Chemical Problems by Tensor Decomposition
od: Nina Glaser, et al.
Izdano: (2024-04-01)

A Network Decomposition Approach for Efficient Sum of Squares Programming Based Analysis
od: Anderson, J, et al.
Izdano: (2010)

Solving multistage quantified linear optimization problems with the alpha–beta nested Benders decomposition
od: Ulf Lorenz, et al.
Izdano: (2015-11-01)

On the Explicit Scheme with Variable Time Steps for Solving the Parabolic Optimal Control Problem
od: A.D. Romanenko
Izdano: (2016-09-01)

Chordal and factor-width decompositions for scalable semidefinite and polynomial optimization
od: Zheng, Y, et al.
Izdano: (2021)

THE PROBLEM OF FORMULATING THE PRINCIPLES OF TEACHING AND WAYS TO SOLVE IT
od: Azat М. Gaifutdinov, et al.
Izdano: (2024-10-01)

Dynamical system decomposition using dissipation inequalities.
od: Anderson, J, et al.
Izdano: (2011)

Decomposition method in solving multicommodity network flow problem /
od: 494150 Norhuda Ikhsan, et al.
Izdano: (2008)

A tree search algorithm towards solving Ising formulated combinatorial optimization problems
od: Yunuo Cen, et al.
Izdano: (2022-08-01)

Model decomposition and reduction tools for large-scale networks in systems biology.
od: Anderson, J, et al.
Izdano: (2011)

Tear-and-Interconnect Domain Decomposition Scheme for Solving Multiscale Composite Penetrable Objects
od: Victor F. Martin, et al.
Izdano: (2020-01-01)

Stability analysis of power systems using network decomposition and local gain analysis
od: Anghel, M, et al.
Izdano: (2013)

Chaotic Binarization Schemes for Solving Combinatorial Optimization Problems Using Continuous Metaheuristics
od: Felipe Cisternas-Caneo, et al.
Izdano: (2024-01-01)

New Modified Adomian Decomposition Recursion Schemes for Solving Certain Types of Nonlinear Fractional Two-Point Boundary Value Problems
od: Sekson Sirisubtawee, et al.
Izdano: (2017-01-01)

Translation, solving scheme, and implementation of a periodic and optimal impulsive state control problem
od: Ying Song, et al.
Izdano: (2018-03-01)

Some approaches to solving bratu problems based on the decomposition method /
od: 216973 Goh, Chiou Keng, et al.
Izdano: (2006)

Surface Integral Equation-Domain Decomposition Scheme for Solving Multiscale Nanoparticle Assemblies With Repetitions
od: Diego M. Solis, et al.
Izdano: (2016-01-01)

A partitioning scheme for solving the 0-1 knapsack problem
od: M.F. Kruger, et al.
Izdano: (2014-01-01)

Sensitivity Analysis of the Data Assimilation-Driven Decomposition in Space and Time to Solve PDE-Constrained Optimization Problems
od: Luisa D’Amore, et al.
Izdano: (2023-05-01)

Solving problems in vibrations /
od: 445029 Anderson, J. S., et al.
Izdano: (1987)

Petri Net Modeling and Decomposition Method for Solving Production Scheduling Problems
od: Tatsushi NISHI, et al.
Izdano: (2007-04-01)

Adomian decomposition method for solving initial value problems in vibration models
od: Mungkasi Sudi, et al.
Izdano: (2018-01-01)

CROSSROADS--Identifying Viable “Need-Solution Pairs”: Problem Solving Without Problem Formulation
od: von Krogh, Georg, et al.
Izdano: (2016)

CROSSROADS—Identifying Viable “Need–Solution Pairs”: Problem Solving Without Problem Formulation
od: von Hippel, Eric A., et al.
Izdano: (2017)

Efficient decomposition-based algorithm to solve long-term pipeline scheduling problem
od: S. Moradi, et al.
Izdano: (2019-08-01)

Analysis of nonlinear time-delay systems using the sum of squares decomposition
od: Papachristodoulou, A
Izdano: (2004)

Modified ADMM algorithm for solving proximal bound formulation of multi-delay optimal control problem with bounded control
od: K.A. Dawodu
Izdano: (2022-03-01)

Analysis of non-polynomial systems using the sum of squares decomposition
od: Papachristodoulou, A, et al.
Izdano: (2005)

Splitting schemes for the stress formulation of fluid–structure interaction problems
od: Peter Minev, et al.
Izdano: (2022-03-01)

Variational Iteration Decomposition Method for Solving Eighth-Order Boundary Value Problems
od: Muhammad Aslam Noor, et al.
Izdano: (2007-01-01)

Practical method to solve large least squares problems using Cholesky decomposition
od: Ghadi Younis
Izdano: (2015-10-01)

Decomposition and completion of sum-of-squares matrices
od: Zheng, Y, et al.
Izdano: (2018)

Experimentation with Benders decomposition for solving the two-timescale stochastic generation capacity expansion problem
od: Goran Vojvodic, et al.
Izdano: (2023-01-01)

Analysis of nonlinear time-delay systems using the sum of squares decomposition
od: Papachristodoulou, A, et al.
Izdano: (2004)

Generic DNA encoding design scheme to solve combinatorial problems
od: Rofilde, Hasudungan
Izdano: (2015)

Presentation of the efficient scheme for solving fractional order telegraph problems
od: Wasim Sajjad Hussain, et al.
Izdano: (2024-12-01)