A first order method for linear programming parameterized by circuit imbalance. [PDF]
Math ProgramCole R, Hertrich C, Tao Y, Végh LA.
europepmc +1 more source
, 1996 A generalized class of infeasible-interior-point methods for solving horizontal linear complementarity problem is analyzed and sufficient conditions are given for the convergence of the sequence of iterates produced by methods in this class.
J. Frédéric Bonnans, Florian A. Potra
core
On stable least squares solution to the system of linear inequalities
Open Mathematics, 2007 Übi Evald
doaj +1 more source
A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique. [PDF]
Comput Optim ApplKarapetyants MA.
europepmc +1 more source
A class of derivative-free trust-region methods with interior backtracking technique for nonlinear optimization problems subject to linear inequality constraints. [PDF]
J Inequal Appl, 2018 Gao J, Cao J.
europepmc +1 more source
Smoothing sample average approximation method for solving stochastic second-order-cone complementarity problems. [PDF]
J Inequal Appl, 2018 Luo M, Zhang Y.
europepmc +1 more source
Using Positive Spanning Sets to Achieve d-Stationarity with the Boosted DC Algorithm. [PDF]
Vietnam J Math, 2020 Artacho FJA, Campoy R, Vuong PT.
europepmc +1 more source
Optimizing Of Sums And Products Of Linear Fractional Functions Under Linear Constraints
, 1995 . In this paper, we consider nonconvex optimization problems whose objective functions are composed of parts easily to optimize on polyhedral sets. This allows to develop algorithms which take advantage of the special structure of the problems.
Joachim Hirche
core
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods. [PDF]
Math ProgramAhookhosh M, Nesterov Y.
europepmc +1 more source
Analytic center cutting plane methods for variational inequalities over convex bodies. [PDF]
J Inequal Appl, 2018 Zeng R.
europepmc +1 more source