Geodesic algorithms in Riemannian geometry.
Geometric algorithms and combinatorial optimization [Book]
Geometric algorithms and combinatorial optimization [Book]
Geometrical/Geographical Optimization and Fast Automatic Differentiation
Geometry of the Gass-Saaty Parametric Cost LP Algorithm.
Global and local optimality conditions in set-valued optimization problems.
Global convergence of a modified SQP method for mathematical programs with inequalities and equalities constraints.
Global convergence property of modified Levenberg-Marquardt methods for nonsmooth equations
In this paper, we discuss the globalization of some kind of modified Levenberg-Marquardt methods for nonsmooth equations and their applications to nonlinear complementarity problems. In these modified Levenberg-Marquardt methods, only an approximate solution of a linear system at each iteration is required. Under some mild assumptions, the global convergence is shown. Finally, numerical results show that the present methods are promising.
Global optimization by artificial life : a new technique using genetic population evolution
Global optimization for sum of linear ratios problem using new pruning technique.
Global Optimization Using Interval Analysis - The Multi-Dimensional Case.
Global solution of optimal shape design problems.
Globalization of SQP-methods in control of the instationary Navier-Stokes equations
A numerically inexpensive globalization strategy of sequential quadratic programming methods (SQP-methods) for control of the instationary Navier Stokes equations is investigated. Based on the proper functional analytic setting a convergence analysis for the globalized method is given. It is argued that the a priori formidable SQP-step can be decomposed into linear primal and linear adjoint systems, which is amenable for existing CFL-software. A report on a numerical test demonstrates the feasibility...
Globalization of SQP-Methods in Control of the Instationary Navier-Stokes Equations
A numerically inexpensive globalization strategy of sequential quadratic programming methods (SQP-methods) for control of the instationary Navier Stokes equations is investigated. Based on the proper functional analytic setting a convergence analysis for the globalized method is given. It is argued that the a priori formidable SQP-step can be decomposed into linear primal and linear adjoint systems, which is amenable for existing CFL-software. A report on a numerical test demonstrates the feasibility...
Goffin's algorithm for zonotopes
The Löwner-John ellipse of a full-dimensional bounded convex set is a circumscribed ellipse with the property that if we shrink it by the factor (where is dimension), we obtain an inscribed ellipse. Goffin’s algorithm constructs, in polynomial time, a tight approximation of the Löwner-John ellipse of a polyhedron given by facet description. In this text we adapt the algorithm for zonotopes given by generator descriptions. We show that the adapted version works in time polynomial in the size...
Gradient flow optimization for reducing blocking effects of transform coding
This paper addresses the problem of reducing blocking effects in transform coding. A novel optimization approach using the gradient flow is proposed. Using some properties of the gradient flow on a manifold, an optimized filter design method for reducing the blocking effects is presented. Based on this method, an image reconstruction algorithm is derived. The algorithm maintains the fidelity of images while reducing the blocking effects. Experimental tests demonstrate that the presented algorithm...
Gradient method in Sobolev spaces for nonlocal boundary-value problems.
Gradient method with dynamical retards for large-scale optimization problems.
Gradient observability for diffusion systems
The aim of this paper is to study regional gradient observability for a diffusion system and the reconstruction of the state gradient without the knowledge of the state. First, we give definitions and characterizations of these new concepts and establish necessary conditions for the sensor structure in order to obtain regional gradient observability. We also explore an approach which allows for a regional gradient reconstruction. The developed method is original and leads to a numerical algorithm...
Graph centers used for stabilization of matrix factorizations
Systems of consistent linear equations with symmetric positive semidefinite matrices arise naturally while solving many scientific and engineering problems. In case of a "floating" static structure, the boundary conditions are not sufficient to prevent its rigid body motions. Traditional solvers based on Cholesky decomposition can be adapted to these systems by recognition of zero rows or columns and also by setting up a well conditioned regular submatrix of the problem that...