| Publication | Date of Publication | Type |
|---|
Primal subgradient methods with predefined step sizes
Journal of Optimization Theory and Applications | 2024-12-27 | Paper |
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
Mathematical Programming. Series A. Series B | 2024-11-07 | Paper |
Set-limited functions and polynomial-time interior-point methods
Journal of Optimization Theory and Applications | 2024-09-02 | Paper |
Gradient regularization of Newton method with Bregman distances
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Correction to: ``Computation of Fisher-Gale equilibrium by auction
Journal of the Operations Research Society of China | 2024-02-09 | Paper |
Super-Universal Regularized Newton Method
SIAM Journal on Optimization | 2024-01-17 | Paper |
High-Order Reduced-Gradient Methods for Composite Variational Inequalities
| 2023-11-25 | Paper |
Primal subgradient methods with predefined stepsizes
| 2023-11-23 | Paper |
Adaptive Third-Order Methods for Composite Convex Optimization
SIAM Journal on Optimization | 2023-08-11 | Paper |
Conic optimization-based algorithms for nonnegative matrix factorization
Optimization Methods & Software | 2023-08-09 | Paper |
Convex quartic problems: homogenized gradient method and preconditioning
| 2023-06-30 | Paper |
Subgradient ellipsoid method for nonsmooth convex problems
Mathematical Programming. Series A. Series B | 2023-05-02 | Paper |
Inexact accelerated high-order proximal-point methods
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
Affine-invariant contracting-point methods for convex optimization
Mathematical Programming. Series A. Series B | 2023-03-01 | Paper |
Gradient Methods for Stochastic Optimization in Relative Scale
| 2023-01-19 | Paper |
Gradient methods with memory
Optimization Methods & Software | 2022-10-06 | Paper |
Efficient numerical methods to solve sparse linear equations with application to PageRank
Optimization Methods & Software | 2022-10-06 | Paper |
Inexact basic tensor methods for some classes of convex optimization problems
Optimization Methods & Software | 2022-10-06 | Paper |
Tensor methods for finding approximate stationary points of convex functions
Optimization Methods & Software | 2022-09-30 | Paper |
High-order optimization methods for fully composite problems
SIAM Journal on Optimization | 2022-09-29 | Paper |
Soft clustering by convex electoral model
Soft Computing | 2022-07-21 | Paper |
Rates of superlinear convergence for classical quasi-Newton methods
Mathematical Programming. Series A. Series B | 2022-06-29 | Paper |
Primal-dual accelerated gradient methods with small-dimensional relaxation oracle
Optimization Methods & Software | 2022-06-27 | Paper |
Discrete choice prox-functions on the simplex
Mathematics of Operations Research | 2022-05-17 | Paper |
Local convergence of tensor methods
Mathematical Programming. Series A. Series B | 2022-04-29 | Paper |
Dynamic pricing under nested logit demand
| 2022-02-01 | Paper |
Quartic Regularity
| 2022-01-13 | Paper |
Inexact high-order proximal-point methods with auxiliary search procedure
SIAM Journal on Optimization | 2021-12-01 | Paper |
Superfast second-order methods for unconstrained convex optimization
Journal of Optimization Theory and Applications | 2021-11-18 | Paper |
High-order methods beyond the classical complexity bounds, II: inexact high-order proximal-point methods with segment search
| 2021-09-25 | Paper |
High-order methods beyond the classical complexity bounds, I: inexact high-order proximal-point methods
| 2021-07-13 | Paper |
New results on superlinear convergence of classical quasi-Newton methods
Journal of Optimization Theory and Applications | 2021-06-15 | Paper |
Minimizing uniformly convex functions by cubic regularization of Newton method
Journal of Optimization Theory and Applications | 2021-06-15 | Paper |
Computation of the analytic center of the solution set of the linear matrix inequality arising in continuous- and discrete-time passivity analysis
Vietnam Journal of Mathematics | 2021-04-29 | Paper |
On inexact solution of auxiliary problems in tensor methods for convex optimization
Optimization Methods & Software | 2021-04-15 | Paper |
Optimization Methods for Fully Composite Problems
| 2021-03-23 | Paper |
Greedy quasi-Newton methods with explicit superlinear convergence
SIAM Journal on Optimization | 2021-03-10 | Paper |
Implementable tensor methods in unconstrained convex optimization
Mathematical Programming. Series A. Series B | 2021-02-15 | Paper |
Contracting proximal methods for smooth convex optimization
SIAM Journal on Optimization | 2020-12-11 | Paper |
Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
SIAM Journal on Optimization | 2020-10-08 | Paper |
Affine-invariant contracting-point methods for Convex Optimization
| 2020-09-18 | Paper |
Convex optimization based on global lower second-order models
| 2020-06-15 | Paper |
Smoothness parameter of power of Euclidean norm
Journal of Optimization Theory and Applications | 2020-05-11 | Paper |
On the quality of first-order approximation of functions with Hölder continuous gradient
Journal of Optimization Theory and Applications | 2020-04-07 | Paper |
Inexact Tensor Methods with Dynamic Accuracies
| 2020-02-21 | Paper |
Computing Closest Stable Nonnegative Matrix
SIAM Journal on Matrix Analysis and Applications | 2020-01-17 | Paper |
Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems
Doklady Mathematics | 2019-07-18 | Paper |
Tensor Methods for Finding Approximate Stationary Points of Convex Functions
| 2019-07-13 | Paper |
Linear convergence of first order methods for non-strongly convex optimization
Mathematical Programming. Series A. Series B | 2019-05-17 | Paper |
Dual methods for finding equilibriums in mixed models of flow distribution in large transportation networks
Computational Mathematics and Mathematical Physics | 2019-01-15 | Paper |
Accelerated regularized Newton methods for minimizing composite convex functions
SIAM Journal on Optimization | 2019-01-14 | Paper |
Computation of Fisher-Gale equilibrium by auction
Journal of the Operations Research Society of China | 2018-08-10 | Paper |
Lectures on convex optimization
Springer Optimization and Its Applications | 2018-07-23 | Paper |
Universal method for stochastic composite optimization problems
Computational Mathematics and Mathematical Physics | 2018-04-25 | Paper |
Relatively smooth convex optimization by first-order methods, and applications
SIAM Journal on Optimization | 2018-02-14 | Paper |
Random block coordinate descent methods for linearly constrained optimization over networks
Journal of Optimization Theory and Applications | 2017-09-01 | Paper |
Distributed price adjustment based on convex analysis
Journal of Optimization Theory and Applications | 2017-06-22 | Paper |
Regularized Newton methods for minimizing functions with Hölder continuous hessians
SIAM Journal on Optimization | 2017-05-30 | Paper |
Random gradient-free minimization of convex functions
Foundations of Computational Mathematics | 2017-05-23 | Paper |
Efficiency of the accelerated coordinate descent method on structured optimization problems
SIAM Journal on Optimization | 2017-01-31 | Paper |
Algorithmic principle of least revenue for finding market equilibria
Optimization and Its Applications in Control and Data Sciences | 2017-01-27 | Paper |
A subgradient method for free material design
SIAM Journal on Optimization | 2016-11-15 | Paper |
Efficient numerical methods for entropy-linear programming problems
Computational Mathematics and Mathematical Physics | 2016-10-19 | Paper |
Excessive revenue model of competitive markets
Nonlinear Analysis and Optimization | 2016-09-02 | Paper |
Finding the stationary states of Markov chains by iterative methods
Applied Mathematics and Computation | 2016-06-22 | Paper |
Primal-dual method for searching equillibriums in mixed traffic assignment problems
| 2016-04-27 | Paper |
Universal fast gradient method for stochastic composit optimization problems
| 2016-04-18 | Paper |
Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods
| 2016-03-02 | Paper |
Primal-dual methods for solving infinite-dimensional games
Journal of Optimization Theory and Applications | 2015-09-03 | Paper |
Nearest stable system using successive convex approximations
Automatica | 2015-08-27 | Paper |
On the efficiency of a randomized mirror descent algorithm in online optimization problems
Computational Mathematics and Mathematical Physics | 2015-07-13 | Paper |
Universal method with inexact oracle and its applications for searching equillibriums in multistage transport problems
| 2015-05-31 | Paper |
On the three-stage version of stable dynamic model
| 2015-02-18 | Paper |
Primal-dual subgradient method for huge-scale linear conic problems
SIAM Journal on Optimization | 2014-12-12 | Paper |
Stochastic gradient methods with inexact oracle
| 2014-11-16 | Paper |
Learning Supervised PageRank with Gradient-Free Optimization Methods
| 2014-11-16 | Paper |
Entropy linear programming
| 2014-10-28 | Paper |
Efficient randomized mirror descents in stochastic online convex optimization
| 2014-10-12 | Paper |
Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
Stochastic Systems | 2014-10-07 | Paper |
First-order methods of smooth convex optimization with inexact oracle
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
Subgradient methods for huge-scale optimization problems
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
Positivity and linear matrix inequalities
European Journal of Control | 2014-08-07 | Paper |
On first-order algorithms for \(\ell_{1}/\)nuclear norm minimization
Acta Numerica | 2014-06-11 | Paper |
Confidence level solutions for stochastic programming
Automatica | 2014-03-19 | Paper |
Primal-dual subgradient methods for minimizing uniformly convex functions
| 2014-01-08 | Paper |
Optimizing the spectral radius
SIAM Journal on Matrix Analysis and Applications | 2013-12-13 | Paper |
Gradient methods for minimizing composite functions
Mathematical Programming. Series A. Series B | 2013-08-12 | Paper |
Hessian distances and their applications in the complexity analysis of interior-point methods
Optimization Methods & Software | 2013-06-24 | Paper |
Towards non-symmetric conic optimization
Optimization Methods & Software | 2012-11-06 | Paper |
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
Mathematical Programming. Series A. Series B | 2012-11-02 | Paper |
Efficiency of coordinate descent methods on huge-scale optimization problems
SIAM Journal on Optimization | 2012-09-12 | Paper |
Double smoothing technique for large-scale linearly constrained convex optimization
SIAM Journal on Optimization | 2012-09-12 | Paper |
Generalized power method for sparse principal component analysis
Journal of Machine Learning Research (JMLR) | 2012-07-13 | Paper |
Design and operations of gas transmission networks
Operations Research | 2012-06-18 | Paper |
Solving strongly monotone variational and quasi-variational inequalities
Discrete and Continuous Dynamical Systems | 2011-12-20 | Paper |
Recent advances in structural optimization
| 2011-11-11 | Paper |
Unconstrained convex minimization in relative scale
Mathematics of Operations Research | 2011-04-27 | Paper |
Barrier subgradient method
Mathematical Programming. Series A. Series B | 2011-03-31 | Paper |
Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices
SIAM Journal on Matrix Analysis and Applications | 2010-08-19 | Paper |
Primal central paths and Riemannian distances for convex sets
Foundations of Computational Mathematics | 2009-07-13 | Paper |
Primal-dual subgradient methods for convex problems
Mathematical Programming | 2009-05-05 | Paper |
Primal-dual subgradient methods for convex problems
Mathematical Programming. Series A. Series B | 2009-05-05 | Paper |
Optimizing the Coupling Between Two Isometric Projections of Matrices
SIAM Journal on Matrix Analysis and Applications | 2009-03-06 | Paper |
A gradient-type algorithm optimizing the coupling between matrices
Linear Algebra and its Applications | 2008-08-06 | Paper |
Hybrid Systems: Computation and Control
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Primal-dual subgradient methods for convex problems
Mathematical Programming | 2007-06-19 | Paper |
Primal-dual subgradient methods for convex problems
Mathematical Programming. Series A. Series B | 2007-06-19 | Paper |
Smoothing technique and its applications in semidefinite optimization
Mathematical Programming. Series A. Series B | 2007-05-10 | Paper |
Dual extrapolation and its applications to solving variational inequalities and related problems
Mathematical Programming. Series A. Series B | 2007-03-05 | Paper |
Park and ride for the day period and morning-evening commute
| 2006-10-17 | Paper |
Cubic regularization of Newton method and its global performance
Mathematical Programming. Series A. Series B | 2006-06-28 | Paper |
Computationally Efficient Approximations of the Joint Spectral Radius
SIAM Journal on Matrix Analysis and Applications | 2005-09-19 | Paper |
Optimization Problems over Non-negative Polynomials with Interpolation Constraints
Positive Polynomials in Control | 2005-06-24 | Paper |
On the accuracy of the ellipsoid norm approximation of the joint spectral radius
Linear Algebra and its Applications | 2005-02-23 | Paper |
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
Optimization Problems over Positive Pseudopolynomial Matrices
SIAM Journal on Matrix Analysis and Applications | 2004-01-18 | Paper |
Introductory lectures on convex optimization. A basic course.
Applied Optimization | 2004-01-05 | Paper |
On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
Foundations of Computational Mathematics | 2003-06-23 | Paper |
Multi-parameter surfaces of analytic centers and long-step surface-following interior point methods
Mathematics of Operations Research | 2001-11-26 | Paper |
Homogeneous analytic center cutting plane methods with approximate centers
Optimization Methods & Software | 2000-12-06 | Paper |
scientific article; zbMATH DE number 1534299 (Why is no real title available?)
| 2000-11-23 | Paper |
scientific article; zbMATH DE number 1489808 (Why is no real title available?)
| 2000-10-23 | Paper |
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
Mathematical Programming. Series A. Series B | 2000-07-21 | Paper |
Stable traffic equilibria: Properties and applications
Optimization and Engineering | 2000-01-01 | Paper |
Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
SIAM Journal on Optimization | 1999-11-24 | Paper |
Primal-Dual Interior-Point Methods for Self-Scaled Cones
SIAM Journal on Optimization | 1998-05-12 | Paper |
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
Mathematics of Operations Research | 1997-06-09 | Paper |
An interior-point method for generalized linear-fractional programming
Mathematical Programming. Series A. Series B | 1996-09-18 | Paper |
New variants of bundle methods
Mathematical Programming. Series A. Series B | 1996-09-18 | Paper |
scientific article; zbMATH DE number 912314 (Why is no real title available?)
| 1996-08-25 | Paper |
Oligopolistic Competition and the Optimal Provision of Products
Econometrica | 1996-01-07 | Paper |
scientific article; zbMATH DE number 729680 (Why is no real title available?)
| 1995-03-06 | Paper |
Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem
SIAM Journal on Optimization | 1992-09-27 | Paper |
scientific article; zbMATH DE number 4170640 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4141790 (Why is no real title available?)
| 1989-01-01 | Paper |
scientific article; zbMATH DE number 4062817 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4156204 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4100957 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4079168 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4070648 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4056411 (Why is no real title available?)
| 1987-01-01 | Paper |
Optimal methods of smooth convex minimization
USSR Computational Mathematics and Mathematical Physics | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3934790 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3910150 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3891110 (Why is no real title available?)
| 1984-01-01 | Paper |
One class of methods of unconditional minimization of a convex function, having a high rate of convergence
USSR Computational Mathematics and Mathematical Physics | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3850830 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3772870 (Why is no real title available?)
| 1982-01-01 | Paper |
On a one-dimensional search procedure in methods of unconstrained minimization of a function of several variables
USSR Computational Mathematics and Mathematical Physics | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3791120 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3797101 (Why is no real title available?)
| 1980-01-01 | Paper |
An optimal lower bound for smooth convex functions
| N/A | Paper |
