Search Results - Linearly constrained quadratic optimization problems with complementarity constraints

  • Showing 1 - 13 results of 13
Refine Results
  1. 1

    A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems by Kim, Sunyoung, Kojima, Masakazu, Toh, Kim-Chuan

    ISSN: 0025-5610, 1436-4646
    Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2016
    Published in Mathematical programming (01.03.2016)
    “…We propose an efficient computational method for linearly constrained quadratic optimization problems (QOPs…”
    Get full text
    Journal Article
  2. 2

    Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints by Izmailov, A. F., Solodov, M. V., Uskov, E. I.

    ISSN: 1052-6234, 1095-7189
    Published: Philadelphia Society for Industrial and Applied Mathematics 01.01.2012
    Published in SIAM journal on optimization (01.01.2012)
    “…We consider global convergence properties of the augmented Lagrangian methods on problems with degenerate constraints, with a special emphasis on mathematical programs with complementarity constraints (MPCC…”
    Get full text
    Journal Article
  3. 3

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

    ISSN: 1593-8883, 1129-6569
    Published: Cham Springer International Publishing 01.12.2024
    Published 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…”
    Get full text
    Journal Article
  4. 4

    Inexact Josephy–Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization by Izmailov, A. F., Solodov, M. V.

    ISSN: 0926-6003, 1573-2894
    Published: Boston Springer US 01.06.2010
    “… This perturbed framework is convenient to treat in a unified way standard sequential quadratic programming, its stabilized version, sequential quadratically constrained quadratic programming…”
    Get full text
    Journal Article
  5. 5

    Interior Proximal Algorithm for Quasiconvex Programming Problems and Variational Inequalities with Linear Constraints by Brito, Arnaldo S., da Cruz Neto, J. X., Lopes, Jurandir O., Oliveira, P. Roberto

    ISSN: 0022-3239, 1573-2878
    Published: Boston Springer US 01.07.2012
    “… The first method we propose is for general linearly constrained quasiconvex minimization problems…”
    Get full text
    Journal Article
  6. 6

    An active set algorithm for nonlinear optimization with polyhedral constraints by Hager, William W., Zhang, Hongchao

    ISSN: 1674-7283, 1869-1862
    Published: Beijing Science China Press 01.08.2016
    Published in Science China. Mathematics (01.08.2016)
    “… Phase one of the algorithm is the gradient projection method, while phase two is any algorithm for solving a linearly constrained optimization problem…”
    Get full text
    Journal Article
  7. 7

    Splitting methods for quadratic optimization in data analysis by Galligani, E., Ruggiero, V., Zanni, L.

    ISSN: 0020-7160, 1029-0265
    Published: Abingdon Gordon and Breach Science Publishers 01.01.1997
    “…Many problems arising in data analysis can be formulated as a large sparse strictly convex quadratic programming problems with equality and inequality linear constraints…”
    Get full text
    Journal Article
  8. 8

    A Truncated SQP Method Based on Inexact Interior-Point Solutions of Subproblems by Izmailov, A. F., Solodov, M. V.

    ISSN: 1052-6234, 1095-7189
    Published: Philadelphia Society for Industrial and Applied Mathematics 01.01.2010
    Published in SIAM journal on optimization (01.01.2010)
    “…We consider sequential quadratic programming (SQP) methods applied to optimization problems with nonlinear equality constraints and simple bounds…”
    Get full text
    Journal Article
  9. 9

    Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints by Jian, Jin-bao, Quan, Ran, Zhang, Xue-lu

    ISSN: 0377-0427, 1879-1778
    Published: Amsterdam Elsevier B.V 01.08.2007
    “…In this paper, the nonlinear minimax problems with inequality constraints are discussed, and a sequential quadratic programming (SQP…”
    Get full text
    Journal Article
  10. 10

    A Global Linear and Local Quadratic Continuation Smoothing Method for Variational Inequalities with Box Constraints by Chen, Bintong, Chen, Xiaojun

    ISSN: 0926-6003, 1573-2894
    Published: New York Springer Nature B.V 01.12.2000
    “…In this paper, we propose a continuation method for box constrained variational inequality problems…”
    Get full text
    Journal Article
  11. 11

    On Addressing Nonconvexity, Stochasticity and Complemnentarity in Mathematical Optimization by Xie, Yue

    ISBN: 9798582524304
    Published: ProQuest Dissertations & Theses 01.01.2018
    “…: (I) Of these, the first considers linearly constrained optimization problems with an `0-norm regularization…”
    Get full text
    Dissertation
  12. 12

    Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Quadratic and Semi-Definite Programming by Han, Deren, Sun, Defeng, Zhang, Liwei

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 10.08.2015
    Published in arXiv.org (10.08.2015)
    “…) for solving linearly constrained convex composite optimization problems. Under a certain error bound condition, we establish the global linear rate of convergence…”
    Get full text
    Paper
  13. 13

    New infeasible interior-point algorithm based on monomial method by Yi-Chih, Hsieh, Bricker, Dennis L.

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Published: Oxford Elsevier Ltd 01.07.1996
    Published in Computers & operations research (01.07.1996)
    “…We propose a new infeasible path-following algorithm for the convex linearly-constrained quadratic programming problem…”
    Get full text
    Journal Article