An augmented lagrangian interior point method using diretions of negative curvature [PDF]
We describe an efficient implementation of an interior-point algorithm for non-convex problems that uses directions of negative curvature. These directions should ensure convergence to second-order KKT points and improve the computational efficiency of ...
Moguerza, Javier M. +1 more
core +1 more source
In a Hilbert framework, we introduce continuous and discrete dynamical systems which aim at solving inclusions governed by structured monotone operators $A=\partial\Phi+B$, where $\partial\Phi$ is the subdifferential of a convex lower semicontinuous ...
Abbas, Boushra, Attouch, Hedy
core +1 more source
Uniform Convergence of the Newton Method for Aubin Continuous Maps [PDF]
* This work was supported by National Science Foundation grant DMS 9404431.In this paper we prove that the Newton method applied to the generalized equation y ∈ f(x) + F(x) with a C^1 function f and a set-valued map F acting in Banach spaces, is locally ...
Dontchev, Asen
core
Avoidance trajectories for driver assistance systems via solvers for optimal control problems [PDF]
CD-ROM, Paper No. 294, 8 pages,International audienceAvoidance trajectories for driver assistance systems is an important and active fi eld of research in car industry. Assistance systems with active braking maneuvers rely on car models, e.g.
Baier, Robert +4 more
core +1 more source
Variational image regularization with Euler's elastica using a discrete gradient scheme
This paper concerns an optimization algorithm for unconstrained non-convex problems where the objective function has sparse connections between the unknowns.
Lazić, Jasmina +2 more
core
Estimation and optimal control of the multiscale dynamics of Covid-19: a case study from Cameroon. [PDF]
Fotsa-Mbogne DJ +7 more
europepmc +2 more sources
On new sixth and seventh order iterative methods for solving non-linear equations using homotopy perturbation technique. [PDF]
Thota S, Shanmugasundaram P.
europepmc +1 more source
Tensor methods for finding approximate stationary points of convex functions. [PDF]
Grapiglia GN, Nesterov Y.
europepmc +1 more source
A Sequential Homotopy Method for Mathematical Programming Problems
We propose a sequential homotopy method for the solution of mathematical programming problems formulated in abstract Hilbert spaces under the Guignard constraint qualification.
Bock, Hans Georg, Potschka, Andreas
core
Minimizing Uniformly Convex Functions by Cubic Regularization of Newton Method. [PDF]
Doikov N, Nesterov Y.
europepmc +1 more source

