Search Results - Linearly constrained quadratic optimization problems with complementarity constraints
-
1
A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
ISSN: 0025-5610, 1436-4646Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2016Published 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
Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints
ISSN: 1052-6234, 1095-7189Published: Philadelphia Society for Industrial and Applied Mathematics 01.01.2012Published 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
Optimality conditions for differentiable linearly constrained pseudoconvex programs
ISSN: 1593-8883, 1129-6569Published: Cham Springer International Publishing 01.12.2024Published 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
Inexact Josephy–Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
ISSN: 0926-6003, 1573-2894Published: Boston Springer US 01.06.2010Published in Computational optimization and applications (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
Interior Proximal Algorithm for Quasiconvex Programming Problems and Variational Inequalities with Linear Constraints
ISSN: 0022-3239, 1573-2878Published: Boston Springer US 01.07.2012Published in Journal of optimization theory and applications (01.07.2012)“… The first method we propose is for general linearly constrained quasiconvex minimization problems…”
Get full text
Journal Article -
6
An active set algorithm for nonlinear optimization with polyhedral constraints
ISSN: 1674-7283, 1869-1862Published: Beijing Science China Press 01.08.2016Published 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
Splitting methods for quadratic optimization in data analysis
ISSN: 0020-7160, 1029-0265Published: Abingdon Gordon and Breach Science Publishers 01.01.1997Published in International journal of computer mathematics (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
A Truncated SQP Method Based on Inexact Interior-Point Solutions of Subproblems
ISSN: 1052-6234, 1095-7189Published: Philadelphia Society for Industrial and Applied Mathematics 01.01.2010Published 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
Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
ISSN: 0377-0427, 1879-1778Published: Amsterdam Elsevier B.V 01.08.2007Published in Journal of computational and applied mathematics (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
A Global Linear and Local Quadratic Continuation Smoothing Method for Variational Inequalities with Box Constraints
ISSN: 0926-6003, 1573-2894Published: New York Springer Nature B.V 01.12.2000Published in Computational optimization and applications (01.12.2000)“…In this paper, we propose a continuation method for box constrained variational inequality problems…”
Get full text
Journal Article -
11
On Addressing Nonconvexity, Stochasticity and Complemnentarity in Mathematical Optimization
ISBN: 9798582524304Published: 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
Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Quadratic and Semi-Definite Programming
ISSN: 2331-8422Published: Ithaca Cornell University Library, arXiv.org 10.08.2015Published 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
New infeasible interior-point algorithm based on monomial method
ISSN: 0305-0548, 1873-765X, 0305-0548Published: Oxford Elsevier Ltd 01.07.1996Published 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

