Suchergebnisse - linearly constrained nonlinear programming problems

  1. 1

    A Method of Conjugate Directions for Linearly Constrained Nonlinear Programming Problems von Ritter, Klaus

    ISSN: 0036-1429, 1095-7170
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.06.1975
    Veröffentlicht in SIAM journal on numerical analysis (01.06.1975)
    “… An iterative method is described for the minimization of a continuously differentiable function F(x) of n variables subject to linear inequality constraints …”
    Volltext
    Journal Article
  2. 2

    Computation of optimal investment allocations in a sequential portfolio optimisation von Mavungu, Masiala, Hurwitz, Evan, Marwala, Tshilidzi

    ISSN: 1995-7076, 2312-2803
    Veröffentlicht: AOSIS 26.09.2019
    Veröffentlicht in Journal of Economic and Financial Sciences (26.09.2019)
    “… Orientation: This article is related to Financial Risk Management, Investment Management and Portfolio Optimisation. Research purpose: The aim is to compute …”
    Volltext
    Journal Article
  3. 3

    A hybrid algorithm for linearly constrained minimax problems von Wang, Fusheng

    ISSN: 0254-5330, 1572-9338
    Veröffentlicht: Boston Springer US 01.07.2013
    Veröffentlicht in Annals of operations research (01.07.2013)
    “… In this paper, an algorithm for linearly constrained minimax problems is presented in which we combine the trust-region methods with the line-search methods and curve-search methods …”
    Volltext
    Journal Article
  4. 4

    A Second Order Method for the Linearly Constrained Nonlinear Programming Problem von McCORMICK, GARTH P.

    ISBN: 9780125970501, 148327246X, 9781483245638, 9781483272467, 1483245632, 0125970501
    Veröffentlicht: United States Elsevier Inc 1970
    Veröffentlicht in Nonlinear Programming (1970)
    “… An algorithm using second derivatives for solving the problem: minimize f(x) subject to Ax − b ≥ 0 is presented. Convergence to a Second-Order Kuhn Tucker Point is proved …”
    Volltext
    Buchkapitel
  5. 5

    Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary von Haeser, Gabriel, Liu, Hongcheng, Ye, Yinyu

    ISSN: 0025-5610, 1436-4646
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2019
    Veröffentlicht in Mathematical programming (01.11.2019)
    “… By exploiting an interior point technique, we present first- and second-order optimality conditions for this problem that reduces to classical ones when the derivative on the boundary is available …”
    Volltext
    Journal Article
  6. 6

    An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems von Kong, Weiwei, Melo, Jefferson G., Monteiro, Renato D. C.

    ISSN: 0926-6003, 1573-2894
    Veröffentlicht: New York Springer US 01.06.2020
    Veröffentlicht in Computational optimization and applications (01.06.2020)
    “… ) method proposed earlier by the authors. Both the QP-AIPP method and its variant solve linearly set constrained nonconvex composite optimization problems using a quadratic penalty approach where the generated penalized subproblems …”
    Volltext
    Journal Article
  7. 7

    Issues on a 2–Dimensional Quadratic Sub–Problem and Its Applications in Nonlinear Programming: Trust–Region Methods (TRMs) and Linesearch Based Methods (LBMs) von Fasano, Giovanni, Piermarini, Christian, Roma, Massimo

    ISSN: 1999-4893, 1999-4893
    Veröffentlicht: Basel MDPI AG 01.12.2024
    Veröffentlicht in Algorithms (01.12.2024)
    “… This paper analyses the solution of a specific quadratic sub-problem, along with its possible applications, within both constrained and unconstrained Nonlinear Programming frameworks …”
    Volltext
    Journal Article
  8. 8

    An Alternating Trust Region Algorithm for Distributed Linearly Constrained Nonlinear Programs, Application to the Optimal Power Flow Problem von Hours, Jean-Hubert, Jones, Colin N.

    ISSN: 0022-3239, 1573-2878
    Veröffentlicht: New York Springer US 01.06.2017
    Veröffentlicht in Journal of optimization theory and applications (01.06.2017)
    “… A novel trust region method for solving linearly constrained nonlinear programs is presented …”
    Volltext
    Journal Article
  9. 9

    Optimality conditions for differentiable linearly constrained pseudoconvex programs von Cambini, Riccardo, Riccardi, Rossana

    ISSN: 1593-8883, 1129-6569
    Veröffentlicht: Cham Springer International Publishing 01.12.2024
    Veröffentlicht in Decisions in economics and finance (01.12.2024)
    “… The aim of this paper is to study optimality conditions for differentiable linearly constrained pseudoconvex programs …”
    Volltext
    Journal Article
  10. 10

    An accelerated augmented Lagrangian method for linearly constrained convex programming with the rate of convergence O(1/k2) von Ke, Yi-fen, Ma, Chang-feng

    ISSN: 1005-1031, 1993-0445
    Veröffentlicht: Hangzhou Editorial Committee of Applied Mathematics - A Journal of Chinese Universities 01.03.2017
    “… ) for solving the linearly constrained convex programming. We show that the convergence rate of AALM is O (1/ k 2 …”
    Volltext
    Journal Article
  11. 11

    CSOLNP: Numerical Optimization Engine for Solving Non-linearly Constrained Problems von Zahery, Mahsa, Maes, Hermine H., Neale, Michael C.

    ISSN: 1832-4274, 1839-2628
    Veröffentlicht: Cambridge, UK Cambridge University Press 01.08.2017
    Veröffentlicht in Twin research and human genetics (01.08.2017)
    “… R package version, 1) alongside some improvements. CSOLNP solves non-linearly constrained optimization problems using a Sequential Quadratic Programming (SQP) algorithm. CSOLNP, NPSOL …”
    Volltext
    Journal Article
  12. 12

    Parallel Algorithms for Large-scale Linearly Constrained Minimization Problem von Han, Cong-ying, Zheng, Fang-ying, Guo, Tian-de, He, Guo-ping

    ISSN: 0168-9673, 1618-3932
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2014
    Veröffentlicht in Acta Mathematicae Applicatae Sinica (01.07.2014)
    “… amount each iteration and is closer to practical applications for solve large-scale nonlinear programming …”
    Volltext
    Journal Article
  13. 13

    Implementing Generating Set Search Methods for Linearly Constrained Minimization von Lewis, Robert Michael, Shepherd, Anne, Torczon, Virginia

    ISSN: 1064-8275, 1095-7197
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.01.2007
    Veröffentlicht in SIAM journal on scientific computing (01.01.2007)
    “… We discuss an implementation of a derivative-free generating set search method for linearly constrained minimization with no assumption of nondegeneracy placed on the constraints …”
    Volltext
    Journal Article
  14. 14

    A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization von Friedlander, Michael P., Saunders, Michael A.

    ISSN: 1052-6234, 1095-7189
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.01.2005
    Veröffentlicht in SIAM journal on optimization (01.01.2005)
    “… For optimization problems with nonlinear constraints, linearly constrained Lagrangian (LCL …”
    Volltext
    Journal Article
  15. 15

    On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems von Ma, Cheng, Zhang, Liansheng

    ISSN: 0096-3003, 1873-5649
    Veröffentlicht: Elsevier Inc 15.11.2015
    Veröffentlicht in Applied mathematics and computation (15.11.2015)
    “… In this paper, we study a new exact and smooth penalty function for the nonlinear mixed discrete programming problem by augumenting only one variable no matter how many constraints …”
    Volltext
    Journal Article
  16. 16

    A primal-dual augmented Lagrangian von Gill, Philip E., Robinson, Daniel P.

    ISSN: 0926-6003, 1573-2894
    Veröffentlicht: Boston Springer US 01.01.2012
    Veröffentlicht in Computational optimization and applications (01.01.2012)
    “… Nonlinearly constrained optimization problems can be solved by minimizing a sequence of simpler unconstrained or linearly constrained subproblems …”
    Volltext
    Journal Article
  17. 17

    On the solution of linearly constrained optimization problems by means of barrier algorithms von Birgin, E. G., Gardenghi, J. L., Martínez, J. M., Santos, S. A.

    ISSN: 1134-5764, 1863-8279
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2021
    Veröffentlicht in TOP (01.07.2021)
    “… Many practical problems require the solution of large-scale constrained optimization problems for which preserving feasibility is a key issue, and the evaluation of the objective function is very expensive …”
    Volltext
    Journal Article
  18. 18

    On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem von Han, Congying, Wang, Yongli, He, Guoping

    ISSN: 0096-3003, 1873-5649
    Veröffentlicht: Amsterdam Elsevier Inc 15.05.2009
    Veröffentlicht in Applied mathematics and computation (15.05.2009)
    “… an asynchronous PVT algorithm for solving large-scale linearly constrained convex minimization problems …”
    Volltext
    Journal Article
  19. 19

    Linearly constrained global optimization via piecewise-linear approximation von Zhang, Hao, Wang, Shuning

    ISSN: 0377-0427, 1879-1778
    Veröffentlicht: Amsterdam Elsevier B.V 15.04.2008
    Veröffentlicht in Journal of computational and applied mathematics (15.04.2008)
    “… This paper considers the problem of optimizing a continuous nonlinear objective function subject to linear constraints via a piecewise-linear approximation …”
    Volltext
    Journal Article
  20. 20

    Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization von Griffin, Joshua D., Kolda, Tamara G., Lewis, Robert Michael

    ISSN: 1064-8275, 1095-7197
    Veröffentlicht: Philadelphia Society for Industrial and Applied Mathematics 01.01.2008
    Veröffentlicht in SIAM journal on scientific computing (01.01.2008)
    “… We describe an asynchronous parallel derivative-free algorithm for linearly constrained optimization …”
    Volltext
    Journal Article