Terkko Navigator / Optimization methods and software

An investigation of Newton-Sketch and subsampled Newton methods

Gradient methods exploiting spectral properties

Towards solving 2-TBSG efficiently

Randomized mechanism design for decentralized network scheduling

Accelerated dual-averaging primal–dual method for composite convex minimization

Convergence rate of the Levenberg-Marquardt method under Hölderian local error bound

Orthogonal canonical correlation analysis and applications

Inexact proximal stochastic second-order methods for nonconvex composite optimization

Stability analysis of a class of sparse optimization problems

An efficient augmented Lagrangian method for support vector machine

Extended formulations of lower-truncated transversal polymatroids

A Newton-bracketing method for a simple conic optimization problem

On a multilevel Levenberg–Marquardt method for the training of artificial neural networks and its application to the solution of partial differential equations

Solving a continuous multifacility location problem by DC algorithms

A Pfaffian formula for matching polynomials of outerplanar graphs

Further results on sum-of-squares tensors

Stochastic proximal linear method for structured non-convex problems

On inexact solution of auxiliary problems in tensor methods for convex optimization

Exponential augmented Lagrangian methods for equilibrium problems

On SOR-like iteration methods for solving weakly nonlinear systems

A dual approach for optimal algorithms in distributed optimization over networks

Training GANs with centripetal acceleration

Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes

Direct search nonsmooth constrained optimization via roundedℓ1 penalty functions

Complexity and performance of an Augmented Lagrangian algorithm

Applications of matroids in electric network theory

A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization

Signed ring families and signed posets

On the existence of affine invariant descent directions

New perspective on some classical results in analysis and optimization

An alternating direction method of multipliers for the eigenvalue complementarity problem

The rate of convergence of proximal method of multipliers for nonlinear programming

Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass

Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function

Projection-free accelerated method for convex optimization

On a transformation of the∗-congruence Sylvester equation for the least squares optimization

Modified Popov's explicit iterative algorithms for solving pseudomonotone equilibrium problems

Primal–dual accelerated gradient methods with small-dimensional relaxation oracle

Composite optimization for the resource allocation problem

On high-order model regularization for multiobjective optimization

Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem

Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods

Universal intermediate gradient method for convex problems with inexact oracle

An inexact first-order method for constrained nonlinear optimization

Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance

Accelerating Fourier–Motzkin elimination using bit pattern trees

GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN

Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences

Adaptive trust-region algorithms for unconstrained optimization

Newton-type multilevel optimization method