On the performance of algorithms for large-scale bound constrained problems

More, J J

Title: On the performance of algorithms for large-scale bound constrained problems

Full Record
Other Related Research

Abstract

We discuss issues that affect the performance of algorithms for the solution of large-scale bound constrained problems on parallel computers. The discussion centers on the solution of the elastic-plastic torsion problem and the journal bearing problem. These two problems are model large-scale quadratic programming problems that arise as finite element approximations to elliptic variational inequalities. Performance issues are illustrated with the GPCG algorithm of More and Toraldo. This algorithm uses the gradient projection method to select an active set and the conjugate gradient method to explore the active set defined by the current iterate. We show that significant improvements in the performance of the GPCG algorithm can be obtained by using partitioning techniques in a parallel environment. We also show that these partitioning techniques lead to almost linear speedups on function-gradient evaluations and Hessian-vector products for partially separable functions. 12 refs., 2 figs., 8 tabs.

Authors:: More, J J

Publication Date:: Thu Feb 01 00:00:00 EST 1990

Research Org.:: Argonne National Lab. (ANL), Argonne, IL (United States)

Sponsoring Org.:: DOE/ER

OSTI Identifier:: 6937883

Report Number(s):: CONF-8910400-1
ON: DE90010084

DOE Contract Number:: W-31109-ENG-38

Resource Type:: Conference

Resource Relation:: Conference: Workshop on large-scale numerical optimization, Ithaca, NY (USA), 19-20 Oct 1989

Country of Publication:: United States

Language:: English

Subject:: 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; TORSION; BOUNDARY-VALUE PROBLEMS; ALGORITHMS; ARRAY PROCESSORS; ELASTICITY; FINITE ELEMENT METHOD; ITERATIVE METHODS; PARALLEL PROCESSING; PERFORMANCE; MATHEMATICAL LOGIC; MECHANICAL PROPERTIES; NUMERICAL SOLUTION; PROGRAMMING; TENSILE PROPERTIES; 990200* - Mathematics & Computers

Citation Formats


                    More, J J. On the performance of algorithms for large-scale bound constrained problems.  United States: N. p., 1990. 
        Web.

Copy to clipboard


                    More, J J. On the performance of algorithms for large-scale bound constrained problems.  United States.

Copy to clipboard


                    More, J J. 1990.  
        "On the performance of algorithms for large-scale bound constrained problems".  United States.  https://www.osti.gov/servlets/purl/6937883.

Copy to clipboard


                    
@article{osti_6937883,

  title        = {On the performance of algorithms for large-scale bound constrained problems},

  author       = {More, J J},

  abstractNote = {We discuss issues that affect the performance of algorithms for the solution of large-scale bound constrained problems on parallel computers. The discussion centers on the solution of the elastic-plastic torsion problem and the journal bearing problem. These two problems are model large-scale quadratic programming problems that arise as finite element approximations to elliptic variational inequalities. Performance issues are illustrated with the GPCG algorithm of More and Toraldo. This algorithm uses the gradient projection method to select an active set and the conjugate gradient method to explore the active set defined by the current iterate. We show that significant improvements in the performance of the GPCG algorithm can be obtained by using partitioning techniques in a parallel environment. We also show that these partitioning techniques lead to almost linear speedups on function-gradient evaluations and Hessian-vector products for partially separable functions. 12 refs., 2 figs., 8 tabs.},

  doi          = {},

  url          = {https://www.osti.gov/biblio/6937883},
  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {Thu Feb 01 00:00:00 EST 1990},

  month        = {Thu Feb 01 00:00:00 EST 1990}

}

Copy to clipboard

Conference:

View Conference (0.87 MB)

Other availability

Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Large-scale sequential quadratic programming algorithms

Technical Report Eldersveld, S

The problem addressed is the general nonlinear programming problem: finding a local minimizer for a nonlinear function subject to a mixture of nonlinear equality and inequality constraints. The methods studied are in the class of sequential quadratic programming (SQP) algorithms, which have previously proved successful for problems of moderate size. Our goal is to devise an SQP algorithm that is applicable to large-scale optimization problems, using sparse data structures and storing less curvature information but maintaining the property of superlinear convergence. The main features are: 1. The use of a quasi-Newton approximation to the reduced Hessian of the Lagrangian function.more »« less
https://doi.org/10.2172/10102731

Full Text Available
Large-scale sequential quadratic programming algorithms

Technical Report Eldersveld, S

The problem addressed is the general nonlinear programming problem: finding a local minimizer for a nonlinear function subject to a mixture of nonlinear equality and inequality constraints. The methods studied are in the class of sequential quadratic programming (SQP) algorithms, which have previously proved successful for problems of moderate size. Our goal is to devise an SQP algorithm that is applicable to large-scale optimization problems, using sparse data structures and storing less curvature information but maintaining the property of superlinear convergence. The main features are: 1. The use of a quasi-Newton approximation to the reduced Hessian of the Lagrangian function.more »« less
https://doi.org/10.2172/6932047

Full Text Available
A trust region algorithm for PDE-constrained optimization with bound constraints using reduced order modeling

Journal Article Aguilo Valentin, Miguel - Computer Methods in Applied Mechanics and Engineering

This paper presents a novel trust region algorithm that relies on proper orthogonal de-composition techniques to construct accurate reduced order models during optimization.The algorithm samples high fidelity snapshots to compute the POD functions that are used to generate reduced order models. The reduced order models are used to replace the computationally intensive high fidelity finite element evaluations during optimization.The proposed algorithm employs a trust region framework to detect loss in predictive ac-curacy in the reduced order model and automatically update the POD functions during optimization. The trust region framework allows the algorithm to use sound mathematical metrics to effectively improvemore »« less
Full Text Available
Algorithms for bound constrained quadratic programing problems

Technical Report More, J; Toraldo, G

We present an algorithm which combines standard active set strategies with the gradient projection method for the solution of quadratic programming problems subject to bounds. We show, in particular, that if the quadratic is bounded below on the feasible set then termination occurs at a stationary point in a finite number of iterations. Moreover, if all stationary points are nondegenerate, termination occurs at a local minimizer. A numerical comparison of the algorithm based on the gradient projection algorithm with a standard active set strategy shows that on mildly degenerate problems the gradient projection algorithm requires considerable less iterations typically decreasesmore »« less
Hybrid conjugate gradient algorithms

Technical Report O'Leary, D

The conjugate gradient algorithm is a standard iterative technique for solving systems of linear and nonlinear equations. This report deals with the development of computationally efficient and more stable variations of the standard conjugate gradient algorithm for problems in which the Jacobian matrix is symmetric and positive definite. Specific applications considered are associated with the solution of finite difference discretizations of elliptic partial differential equations. The applications are in the fields of hydrodynamics and stress analysis; simple numerical examples are given concerning water seepage through a porous earthen dam, the pressure distribution on the lubricant surrounding a journal bearing, andmore »« less

Similar Records