Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
From MaRDI portal
Publication:2643614
DOI10.1007/s10589-006-9003-yzbMath1146.90055OpenAlexW2063748721MaRDI QIDQ2643614
Michael Hagemann, Andreas Wächter, Olaf Schenk
Publication date: 27 August 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/319462/files/10589_2006_Article_9003.pdf
interior-point methodnumerical linear algebrasaddle-point problemmaximum weight matchingnonconvex nonlinear programming
Related Items
An inertia-free filter line-search algorithm for large-scale nonlinear programming, Modelling bubble clusters in compressible liquids, The GBS code for tokamak scrape-off layer simulations, A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners, A compact finite differences exact projection method for the Navier-Stokes equations on a staggered grid with fourth-order spatial precision, On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices, Linear-Time Approximation for Maximum Weight Matching, Efficient numerical methods for strongly anisotropic elliptic equations, Hybrid immersed interface-immersed boundary methods for AC dielectrophoresis, A local wave tracking strategy for efficiently solving mid- and high-frequency Helmholtz problems, An asynchronous direct solver for banded linear systems, An enhanced grain-boundary framework for computational homogenization and micro-cracking simulations of polycrystalline materials, Numerical homogenization of heterogeneous and cellular materials utilizing the finite cell method, Topology optimization with mixed finite elements on regular grids, Classical and all-floating FETI methods for the simulation of arterial tissues, A scalable parallel factorization of finite element matrices with distributed Schur complements, A Multithreaded Recursive and Nonrecursive Parallel Sparse Direct Solver, A mixture theory-based finite element formulation for the study of biodegradation of poroelastic scaffolds, The cost of continuity: a study of the performance of isogeometric finite elements using direct solvers, AMPS: An Augmented Matrix Formulation for Principal Submatrix Updates with Application to Power Grids, Selecting radiotherapy dose distributions by means of constrained optimization problems, A high performance level-block approximate LU factorization preconditioner algorithm, Two-level mortar domain decomposition preconditioners for heterogeneous elliptic problems, Efficient Nonlinear Programming Algorithms for Chemical Process Control and Operations, Extended ALE method for fluid-structure interaction problems with large structural displacements, A DRIFT–DIFFUSION–REACTION MODEL FOR EXCITONIC PHOTOVOLTAIC BILAYERS: ASYMPTOTIC ANALYSIS AND A 2D HDG FINITE ELEMENT SCHEME, A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods, Suppressing van der Waals driven rupture through shear, Efficient Implementation of Total FETI Solver for Graphic Processing Units Using Schur Complement, An arbitrary Lagrangian-Eulerian finite element formulation for a poroelasticity problem stemming from mixture theory, Modelling intergranular and transgranular micro-cracking in polycrystalline materials, Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems, Minimum cost \(b\)-matching problems with neighborhoods, Parallelized Solution of Banded Linear Systems with an Introduction to p-adic Computation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- Scaling and structural condition numbers
- Efficient sparse LU factorization with left-right looking strategy on shared memory multiprocessors
- Optimization techniques for solving elliptic control problems with control and state constraints. I: Boundary control
- Preconditioning indefinite systems in interior point methods for optimization
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- A new pivoting strategy for Gaussian elimination
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
- Numerical solution of saddle point problems
- Iterative Solution of Augmented Systems Arising in Interior Methods
- A numerical evaluation of sparse direct solvers for the solution of large sparse symmetric linear systems of equations
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- Numerical Optimization
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- CUTE
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Interior Methods for Nonlinear Optimization
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Weighted Matchings for Preconditioning Symmetric Indefinite Linear Systems
- Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
- Optimization techniques for solving elliptic control problems with control and state constraints. II: Distributed control
- Benchmarking optimization software with performance profiles.
- Two-level dynamic scheduling in PARDISO: Improved scalability on shared memory multiprocessing systems
