EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"path-following methods"
Narrow search

Narrow search

Year of publication
Subject
All
interior-point methods 3 path following methods 3 Dynamical systems 2 Goal programming 2 Multiobjective optimization problems 2 Pareto-optimal fronts 2 Path-following methods 2 convex optimization 2 path-following methods 2 polynomial-time methods 2 self-concordant barriers 2 Curvature 1 Interior-point methods 1 Iteration complexities 1 Mathematical programming 1 Mathematische Optimierung 1 Multi-objective optimization problems 1 Newton method 1 Optimal control 1 Primal-dual algorithms 1 Riemannan geometry 1 Semidefinite programming 1 Step length 1 Symmetric cone programs 1 Theorie 1 Theory 1 affine-scaling direction 1 conic optimization 1 conic problems 1 dynamical systems 1 infeasible start 1 long-step path-following methods 1 minimal selection 1 p-norm minimization 1 potential-reduction methods 1 self-concordant functions 1 self-scaled barriers 1 structural optimization 1
more ... less ...
Online availability
All
Free 4 Undetermined 4
Type of publication
All
Article 4 Book / Working Paper 4
Type of publication (narrower categories)
All
Article in journal 1 Aufsatz in Zeitschrift 1
Language
All
Undetermined 7 English 1
Author
All
NESTEROV, Yurii 2 Recchioni, Maria Cristina 2 Cristina, Recchioni Maria 1 Elena, Molho 1 Enrico, Miglierina 1 Hildebrand, Roland 1 Kakihara, Satoshi 1 NEMIROVSKI, Arkadi 1 NESTEROV, Yu. 1 Ohara, Atsumi 1 Tsuchiya, Takashi 1
more ... less ...
Institution
All
Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain 3 Facoltà di Economia, Università degli Studi dell'Insubria 1
Published in...
All
CORE Discussion Papers 3 Computational Optimization and Applications 1 Computational Statistics 1 Economics and Quantitative Methods 1 Mathematical Methods of Operations Research 1 Mathematical methods of operations research : ZOR 1
Source
All
RePEc 7 ECONIS (ZBW) 1
Showing 1 - 8 of 8
Cover Image
Optimal step length for the Newton method : case of self-concordant functions
Hildebrand, Roland - In: Mathematical methods of operations research : ZOR 94 (2021) 2, pp. 253-279
Persistent link: https://www.econbiz.de/10012793521
Saved in:
Cover Image
Primal-dual interior-point methods with asymmetric barriers
NESTEROV, Yurii - Center for Operations Research and Econometrics (CORE), … - 2008
In this paper we develop several polynomial-time interior-point methods (IPM) for solving nonlinear primal-dual conic optimization problem. We assume that the barriers for the primal and the dual cone are not conjugate. This broken symmetry does not allow to apply the standard primal-dual IPM....
Persistent link: https://www.econbiz.de/10005008306
Saved in:
Cover Image
Curvature integrals and iteration complexities in SDP and symmetric cone programs
Kakihara, Satoshi; Ohara, Atsumi; Tsuchiya, Takashi - In: Computational Optimization and Applications 57 (2014) 3, pp. 623-665
In this paper, we study iteration complexities of Mizuno-Todd-Ye predictor-corrector (MTY-PC) algorithms in SDP and symmetric cone programs by way of curvature integrals. The curvature integral is defined along the central path, reflecting the geometric structure of the central path. Integrating...
Persistent link: https://www.econbiz.de/10010998381
Saved in:
Cover Image
Towards nonsymmetric conic optimization
NESTEROV, Yu. - Center for Operations Research and Econometrics (CORE), … - 2006
In this paper we propose a new interior-point method, which is based on an extension of the ideas of self-scaled optimization to the general cases. We suggest using the primal correction process to find a scaling point. This point is used to compute a strictly feasible primal-dual pair by simple...
Persistent link: https://www.econbiz.de/10005042857
Saved in:
Cover Image
Central path and Riemannian distances
NESTEROV, Yurii; NEMIROVSKI, Arkadi - Center for Operations Research and Econometrics (CORE), … - 2003
In this paper we study the Riemannian length of the primal central path computed with respect to the local metric defined by a self-concordant function. We show that despite to some examples, in many important situations the length of this path is quite close to the length of geodesic curves. We...
Persistent link: https://www.econbiz.de/10005008264
Saved in:
Cover Image
Box-constrained vector optimization: a steepest descent method without “a priori” scalarization
Enrico, Miglierina; Elena, Molho; Cristina, Recchioni Maria - Facoltà di Economia, Università degli Studi dell'Insubria - 2006
In this paper a notion of descent direction for a vector function defined on a box is introduced. This concept is based on an appropriate convex combination of the “projected” gradients of the components of the objective functions. The proposed approach does not involve an “apriori”...
Persistent link: https://www.econbiz.de/10005827375
Saved in:
Cover Image
A path following method for box-constrained multiobjective optimization with applications to goal programming problems
Recchioni, Maria Cristina - In: Mathematical Methods of Operations Research 58 (2003) 1, pp. 69-85
We propose a path following method to find the Pareto optimal solutions of a box-constrained multiobjective optimization problem. Under the assumption that the objective functions are Lipschitz continuously differentiable we prove some necessary conditions for Pareto optimal points and we give a...
Persistent link: https://www.econbiz.de/10010950145
Saved in:
Cover Image
A path following method for box-constrained multiobjective optimization with applications to goal programming problems
Recchioni, Maria Cristina - In: Computational Statistics 58 (2003) 1, pp. 69-85
We propose a path following method to find the Pareto optimal solutions of a box-constrained multiobjective optimization problem. Under the assumption that the objective functions are Lipschitz continuously differentiable we prove some necessary conditions for Pareto optimal points and we give a...
Persistent link: https://www.econbiz.de/10010759351
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...