Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Comput Optim Appl

Search In Journal Title:

Abbravation: Computational Optimization and Applications

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1016/0042-207x(63)90616-x

Search In DOI:

ISSN

1573-2894

Search In ISSN:
Search In Title Of Papers:

AARbased decomposition algorithm for nonlinear c

Authors: Nima Rabiei Jose J Muñoz
Publish Date: 2015/04/18
Volume: 62, Issue: 3, Pages: 761-786
PDF Link

Abstract

In this paper we present a method for decomposing a class of convex nonlinear programmes which are frequently encountered in engineering plastic analysis These problems have secondorder conic memberships constraints and a single complicating variable in the objective function The method is based on finding the distance between the feasible sets of the decomposed problems and updating the global optimal value according to the value of this distance The latter is found by exploiting the method of averaged alternating reflections which is here adapted to the optimisation problem at hand The method is specially suited for nonlinear problems and as our numerical results show its convergence is independent of the number of variables of each subdomain We have tested the method with an illustrative example and with problems that have more than 10000 variables

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. A benchmark library and a comparison of heuristic methods for the linear ordering problem
  2. Compression and denoising using l 0 -norm
  3. Classification of companies using maximal margin ellipsoidal surfaces
  4. Multi-step nonlinear conjugate gradient methods for unconstrained minimization
  5. Optimization-based design of plant-friendly multisine signals using geometric discrepancy criteria
  6. Minimization of the Tikhonov functional in Banach spaces smooth and convex of power type by steepest descent in the dual
  7. Numerical experiments with an inexact Jacobian trust-region algorithm
  8. An interior-point approach for primal block-angular problems
  9. Computing the metric dimension of graphs by genetic algorithms
  10. Some non-interior path-following methods based on a scaled central path for linear complementarity problems
  11. On the resolution of certain discrete univariate max–min problems
  12. A coordinate gradient descent method for ℓ 1 -regularized convex minimization
Search Result: