liu.seSearch for publications in DiVA
Change search
Refine search result
1 - 9 of 9
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Daneva, Maria
    et al.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Lindberg, Per Olov
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    A Conjugate Direction Frank-Wolfe Method for Nonconvex Problems2003Report (Refereed)
    Abstract [en]

    In this paper we propose an algorithm for solving problems with nonconvex objective function and linear constraints. We extend the previously suggested Conjugate direction Frank–Wolfe algorithm to nonconvex problems. We apply our method to multi-class user equilibria under social marginal cost pricing. Results of numerical experiments on Sioux Falls and Winnipeg are reported.

  • 2.
    Daneva, Maria
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Lindberg, Per Olov
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    A Conjugate Direction Frank-Wolfe Method with Applications to the Traffic Assignment Problem2003In: Operations Research Proceedings 2002: Selected Papers of the International Conference on Operations Research (SOR 2002), Klagenfurt, September 2-5, 2002" / [ed] Leopold-Wildburger, U, Springer , 2003, p. -550Chapter in book (Other academic)
    Abstract [en]

    This proceedings volume contains a selection of papers presented at the International Conference on Operations Research (SOR 2002).The contributions cover the broad interdisciplinary spectrum of Operations Research and present recent advances in theory, development of methods, and applications in practice. Subjects covered are Production, Logistics and Supply Chain Production, Marketing and Data Analysis, Transportation and Traffic, Scheduling and Project Management, Telecommunication and Information Technology, Energy and Environment, Public Economy, Health, Agriculture, Education, Banking, Finance, Insurance, Risk Management, Continuous Optimization, Discrete and Combinatorial Optimization, Stochastic and Dynamic Programming, Simulation, Control Theory, Systems Dynamics, Dynamic Games, Game Theory, Auctioning and Bidding, Experimental Economics, Econometrics, Statistics and Mathematical Economics, Fuzzy Logic, Multicriteria Decision Making, Decision Theory.

  • 3.
    Daneva, Maria
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Lindberg, Per Olov
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Conjugate Direction Frank-Wolfe Methods with Applications to Traffic Assignment Problem2003In: International Symposium on Mathematical Programming,2003, 2003Conference paper (Other academic)
  • 4.
    Daneva (Mitradjieva), Maria
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Improved Frank-Wolfe directions with applications to traffic problems2003Licentiate thesis, comprehensive summary (Other academic)
    Abstract [en]

    The main contribution of this thesis is the development of some new efficient algorithms for solving structured linearly constrained optimization problems. The conventional Frank-Wolfe method is one of the most frequently used methods for solving such problems. We develop algorithms based on conjugate directions methods and aim to improve the performance of the pure Frank-Wolfe method by choosing better search directions.

    In the conjugate direction Frank-Wolfe method for linearly constrained convex optimization problems, one performs line search along a direction, which is conjugate to the previous one with respect to the hessian of the objective function at the current point. The new method is applied to the single-class traffic equilibrium problem. The convergence of the presented method is also proved. In a limited set of computational tests the algorithm turns out to be quite efficient, outperforming the pure and "PARTANized" Frank-Wolfe methods.

    One further refinement of the conjugate direction Frank-Wolfe methods. is derived by applying conjugation with respect to the last two directions instead of only the last one.

    We also extend the conjugate direction Frank-Wolfe method to nonconvex optimization problems with linear constraints. We apply this extension to the multi-class traffic equilibrium problem under social marginal cost pricing.

  • 5.
    Daneva (Mitradjieva), Maria
    et al.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Göthe-Lundgren, Maud
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Larsson, Torbjörn
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Patriksson, Michael
    Mathematical Sciences, Chalmers University of Technology and Göteborg University, Gothenburg, Sweden.
    Rydergren, Clas
    Linköping University, Department of Science and Technology. Linköping University, The Institute of Technology.
    A Sequential Linear Programming Algorithm with Multi-dimensional Search: Derivation and Convergence2007Article in journal (Other academic)
    Abstract [en]

    We present a sequential linear programming, SLP, algorithm in which the traditional line-search step is replaced by a multi-dimensional search. The algorithm is based on inner approximations of both the primal and dual spaces, which yields a method which in the primal space combines column and constraint generation. The algorithm does not use a merit function, and the linear programming subproblem of the algorithm differs from the one obtained in traditional methods of this type, in the respect that linearized constraints are taken into account only implicitly in a Lagrangiandual fashion. Convergence to a point that satisfies the Karush-Kuhn-Tucker conditions is established. We apply the new method to a selection of the Hoch-Schittkowski’s nonlinear test problems and report a preliminary computational study in a Matlab environment. Since the proposed algorithmcombines column and constraint generation, it should be advantageous with large numbers of variables and constraints.

  • 6.
    Daneva (Mitradjieva), Maria
    et al.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Larsson, Torbjörn
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Patriksson, Michael
    Mathematical Sciences, Chalmers University of Technology and Göteborg University, Gothenburg, Sweden.
    Rydergren, Clas
    Linköping University, Department of Science and Technology. Linköping University, The Institute of Technology.
    A Comparison of Feasible Direction Methods for the Stochastic Transportation Problem2010In: Computational optimization and applications, ISSN 0926-6003, E-ISSN 1573-2894, Vol. 46, no 3, p. 451-466Article in journal (Refereed)
    Abstract [en]

    The feasible direction method of Frank and Wolfe has been claimed to be efficient for solving the stochastic transportation problem. While this is true for very moderate accuracy requirements, substantially more efficient algorithms are otherwise diagonalized Newton and conjugate Frank–Wolfe algorithms, which we describe and evaluate. Like the Frank–Wolfe algorithm, these two algorithms take advantage of the structure of the stochastic transportation problem. We also introduce a Frank–Wolfe type algorithm with multi-dimensional search; this search procedure exploits the Cartesian product structure of the problem. Numerical results for two classic test problem sets are given. The three new methods that are considered are shown to be superior to the Frank–Wolfe method, and also to an earlier suggested heuristic acceleration of the Frank–Wolfe method.

  • 7.
    Daneva (Mitradjieva), Maria
    et al.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Lindberg, Per Olov
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    The Stiff is Moving - Conjugate Direction Frank -Wolfe Methods with Applications to Traffic Assignment2013In: Transportation Science, ISSN 0041-1655, E-ISSN 1526-5447, Vol. 47, no 2, p. 280-293Article in journal (Refereed)
    Abstract [en]

    We present versions of the Frank-Wolfe method for linearly constrained convex programs, in which consecutive search directions are made conjugate. Preliminary computational studies in a MATLAB environment applying pure Frank-Wolfe, conjugate direction Frank-Wolfe (CFW), bi-conjugate Frank-Wolfe (BFW), and "partanized" Frank-Wolfe methods to some classical Traffic Assignment Problems show that CFW and BFW compare favorably to the other methods. This spurred a more detailed study, comparing our methods to an origin-based algorithm. This study indicates that our methods are competitive for accuracy requirements ensuring link flow stability. We also show that CFW is globally convergent. We further point at independent studies by other researchers that show that our methods compare favorably with recent bush-based and gradient projection algorithms on computers with several cores

  • 8.
    Engelson, Leonid
    et al.
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    Lindberg, Per Olov
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Daneva, Maria
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Multi-Class User Equilibria under Social Marginal Cost Pricing2002In: Operations Research 2002, 2002, p. 174-179Conference paper (Other academic)
    Abstract [en]

    In the congested cities of today, congestion pricing is a tempting alternative. With a single user class, already Beckmann et al. showed that ``system optimal'' traffic flows can be achieved by social marginal cost (SMC) pricing where users have to pay for the delays the incur on others. However different user classes can have widly differing time values. Hence, when introducing tolls, one should consider multi-class user equilibria, where the classes have different time values. In the single class case, the equilibrium conditions can be viewn as optimality conditions of an equivalent optimization problem. In the multi-class case, however, netter claims that this is not possible. We show that, depending on the formulation, the multi-class SMC-pricing equilibrium problem (with different time values) can be stated either as an asymmetric or as a symmetric equilibrium problem. In the latter case, the corresponding optimization problems is in general non-convex. For this non-convex problem, we devise descent methods of Frank-Wolfe type. We apply the methods and study a synthetic case based on Sioux Falls.

  • 9.
    Mitradjieva-Daneva, Maria
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Feasible Direction Methods for Constrained Nonlinear Optimization: Suggestions for Improvements2007Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    This thesis concerns the development of novel feasible direction type algorithms for constrained nonlinear optimization. The new algorithms are based upon enhancements of the search direction determination and the line search steps.

    The Frank-Wolfe method is popular for solving certain structured linearly constrained nonlinear problems, although its rate of convergence is often poor. We develop improved Frank--Wolfe type algorithms based on conjugate directions. In the conjugate direction Frank-Wolfe method a line search is performed along a direction which is conjugate to the previous one with respect to the Hessian matrix of the objective. A further refinement of this method is derived by applying conjugation with respect to the last two directions, instead of only the last one.

    The new methods are applied to the single-class user traffic equilibrium problem, the multi-class user traffic equilibrium problem under social marginal cost pricing, and the stochastic transportation problem. In a limited set of computational tests the algorithms turn out to be quite efficient. Additionally, a feasible direction method with multi-dimensional search for the stochastic transportation problem is developed.

    We also derive a novel sequential linear programming algorithm for general constrained nonlinear optimization problems, with the intention of being able to attack problems with large numbers of variables and constraints. The algorithm is based on inner approximations of both the primal and the dual spaces, which yields a method combining column and constraint generation in the primal space.

    List of papers
    1. The Stiff is Moving - Conjugate Direction Frank -Wolfe Methods with Applications to Traffic Assignment
    Open this publication in new window or tab >>The Stiff is Moving - Conjugate Direction Frank -Wolfe Methods with Applications to Traffic Assignment
    2013 (English)In: Transportation Science, ISSN 0041-1655, E-ISSN 1526-5447, Vol. 47, no 2, p. 280-293Article in journal (Refereed) Published
    Abstract [en]

    We present versions of the Frank-Wolfe method for linearly constrained convex programs, in which consecutive search directions are made conjugate. Preliminary computational studies in a MATLAB environment applying pure Frank-Wolfe, conjugate direction Frank-Wolfe (CFW), bi-conjugate Frank-Wolfe (BFW), and "partanized" Frank-Wolfe methods to some classical Traffic Assignment Problems show that CFW and BFW compare favorably to the other methods. This spurred a more detailed study, comparing our methods to an origin-based algorithm. This study indicates that our methods are competitive for accuracy requirements ensuring link flow stability. We also show that CFW is globally convergent. We further point at independent studies by other researchers that show that our methods compare favorably with recent bush-based and gradient projection algorithms on computers with several cores

    National Category
    Mathematics
    Identifiers
    urn:nbn:se:liu:diva-14437 (URN)10.1287/trsc.1120.0409 (DOI)000318852300010 ()
    Available from: 2007-04-27 Created: 2007-04-27 Last updated: 2017-12-13
    2. Multi-Class User Equilibria under Social Marginal Cost Pricing
    Open this publication in new window or tab >>Multi-Class User Equilibria under Social Marginal Cost Pricing
    2002 (English)In: Operations Research 2002, 2002, p. 174-179Conference paper, Published paper (Other academic)
    Abstract [en]

    In the congested cities of today, congestion pricing is a tempting alternative. With a single user class, already Beckmann et al. showed that ``system optimal'' traffic flows can be achieved by social marginal cost (SMC) pricing where users have to pay for the delays the incur on others. However different user classes can have widly differing time values. Hence, when introducing tolls, one should consider multi-class user equilibria, where the classes have different time values. In the single class case, the equilibrium conditions can be viewn as optimality conditions of an equivalent optimization problem. In the multi-class case, however, netter claims that this is not possible. We show that, depending on the formulation, the multi-class SMC-pricing equilibrium problem (with different time values) can be stated either as an asymmetric or as a symmetric equilibrium problem. In the latter case, the corresponding optimization problems is in general non-convex. For this non-convex problem, we devise descent methods of Frank-Wolfe type. We apply the methods and study a synthetic case based on Sioux Falls.

    National Category
    Mathematics
    Identifiers
    urn:nbn:se:liu:diva-14438 (URN)978-3-540-00387-8 (ISBN)
    Available from: 2007-04-27 Created: 2007-04-27 Last updated: 2009-05-11
    3. A Conjugate Direction Frank-Wolfe Method for Nonconvex Problems
    Open this publication in new window or tab >>A Conjugate Direction Frank-Wolfe Method for Nonconvex Problems
    2003 (English)Report (Refereed)
    Abstract [en]

    In this paper we propose an algorithm for solving problems with nonconvex objective function and linear constraints. We extend the previously suggested Conjugate direction Frank–Wolfe algorithm to nonconvex problems. We apply our method to multi-class user equilibria under social marginal cost pricing. Results of numerical experiments on Sioux Falls and Winnipeg are reported.

    Series
    LiTH-MAT-R, ISSN 0348-2960 ; 2003:09
    National Category
    Mathematics
    Identifiers
    urn:nbn:se:liu:diva-14439 (URN)
    Available from: 2007-04-27 Created: 2007-04-27 Last updated: 2016-07-01Bibliographically approved
    4. A Comparison of Feasible Direction Methods for the Stochastic Transportation Problem
    Open this publication in new window or tab >>A Comparison of Feasible Direction Methods for the Stochastic Transportation Problem
    2010 (English)In: Computational optimization and applications, ISSN 0926-6003, E-ISSN 1573-2894, Vol. 46, no 3, p. 451-466Article in journal (Refereed) Published
    Abstract [en]

    The feasible direction method of Frank and Wolfe has been claimed to be efficient for solving the stochastic transportation problem. While this is true for very moderate accuracy requirements, substantially more efficient algorithms are otherwise diagonalized Newton and conjugate Frank–Wolfe algorithms, which we describe and evaluate. Like the Frank–Wolfe algorithm, these two algorithms take advantage of the structure of the stochastic transportation problem. We also introduce a Frank–Wolfe type algorithm with multi-dimensional search; this search procedure exploits the Cartesian product structure of the problem. Numerical results for two classic test problem sets are given. The three new methods that are considered are shown to be superior to the Frank–Wolfe method, and also to an earlier suggested heuristic acceleration of the Frank–Wolfe method.

    Keywords
    Stochastic transportation problem, Frank–Wolfe method, Descent methods, Cartesian product sets
    National Category
    Mathematics
    Identifiers
    urn:nbn:se:liu:diva-14440 (URN)10.1007/s10589-008-9199-0 (DOI)000278736100004 ()
    Available from: 2007-04-27 Created: 2007-04-27 Last updated: 2017-12-13
    5. A Sequential Linear Programming Algorithm with Multi-dimensional Search: Derivation and Convergence
    Open this publication in new window or tab >>A Sequential Linear Programming Algorithm with Multi-dimensional Search: Derivation and Convergence
    Show others...
    2007 (English)Article in journal (Other academic) Submitted
    Abstract [en]

    We present a sequential linear programming, SLP, algorithm in which the traditional line-search step is replaced by a multi-dimensional search. The algorithm is based on inner approximations of both the primal and dual spaces, which yields a method which in the primal space combines column and constraint generation. The algorithm does not use a merit function, and the linear programming subproblem of the algorithm differs from the one obtained in traditional methods of this type, in the respect that linearized constraints are taken into account only implicitly in a Lagrangiandual fashion. Convergence to a point that satisfies the Karush-Kuhn-Tucker conditions is established. We apply the new method to a selection of the Hoch-Schittkowski’s nonlinear test problems and report a preliminary computational study in a Matlab environment. Since the proposed algorithmcombines column and constraint generation, it should be advantageous with large numbers of variables and constraints.

    National Category
    Mathematics
    Identifiers
    urn:nbn:se:liu:diva-14441 (URN)
    Available from: 2007-04-27 Created: 2007-04-27 Last updated: 2016-07-01Bibliographically approved
1 - 9 of 9
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf