Results 91 to 100 of about 1,159 (105)

The q-G method : A q-version of the Steepest Descent method for global optimization. [PDF]

Springerplus, 2015
Soterroni AC, Galski RL, Scarabello MC, Ramos FM.   +3 more
europepmc   +1 more source

Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. [PDF]

Math Program, 2018
Gribling S, de Laat D, Laurent M.
europepmc   +1 more source

Global optimization in Hilbert space. [PDF]

Math Program, 2019
Houska B, Chachuat B.
europepmc   +1 more source

Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions. [PDF]

Math Program, 2017
Liu H, Yao T, Li R, Ye Y.
europepmc   +1 more source

An SQP method for mathematical programs with vanishing constraints with strong convergence properties. [PDF]

Comput Optim Appl, 2017
Benko M, Gfrerer H.
europepmc   +1 more source

OPTIMAL COMPUTATIONAL AND STATISTICAL RATES OF CONVERGENCE FOR SPARSE NONCONVEX LEARNING PROBLEMS. [PDF]

Ann Stat, 2014
Wang Z, Liu H, Zhang T.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Real Algebraic Geometry with a View toward Koopman Operator Methods

Oberwolfach Reports, 2023
This workshop was dedicated to the newest developments in real algebraic geometry and their interaction with convex optimization and operator theory. A particular effort was invested in exploring the interrelations with the Koopman operator methods in ...
Didier Henrion, Salma Kuhlmann, Igor Mezić, Victor Vinnikov   +3 more
semanticscholar   +1 more source

Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs

Numerical Mathematics: Theory, Methods and Applications, 2021
In this paper, we analyze the convergence of the Peaceman-Rachford splitting method (PRSM) for a type of nonconvex and nonsmooth optimization with linear constraints, whose objective function is the sum of a proper lower semicontinuous function and a ...
M. Chao
semanticscholar   +1 more source

Mixed-integer Nonlinear Optimization: a hatchery for modern mathematics

Oberwolfach Reports, 2020
The second MFO Oberwolfach Workshop on Mixed-Integer Nonlinear Programming (MINLP) took place between 2nd and 8th June 2019. MINLP refers to one of the hardest Mathematical Programming (MP) problem classes, involving both nonlinear functions as well as ...
Leo Liberti, Sebastian Sager, Angelika Wiegele   +2 more
semanticscholar   +1 more source

On Variational-Like Inequalities and Global Minimization Problem

, 2020
In this paper, we obtain necessary and sufficient conditions, which ensure that all pairs of the solution sets of Stampacchia variational-like inequality, Minty variational-like inequality and global minimization problem coincide.
V. I. Ivanov
semanticscholar   +1 more source