Suchergebnisse - Linearly constrained quadratic optimization problems with complementarity constraints

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

“… We propose an efficient computational method for linearly constrained quadratic optimization problems (QOPs …”
Volltext

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

“… 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 …”
Volltext

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

“… The aim of this paper is to study optimality conditions for differentiable linearly constrained pseudoconvex programs …”
Volltext

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

“… This perturbed framework is convenient to treat in a unified way standard sequential quadratic programming, its stabilized version, sequential quadratically constrained quadratic programming …”
Volltext

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

“… The first method we propose is for general linearly constrained quasiconvex minimization problems …”
Volltext

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

“… Phase one of the algorithm is the gradient projection method, while phase two is any algorithm for solving a linearly constrained optimization problem …”
Volltext

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

“… Many problems arising in data analysis can be formulated as a large sparse strictly convex quadratic programming problems with equality and inequality linear constraints …”
Volltext

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

“… We consider sequential quadratic programming (SQP) methods applied to optimization problems with nonlinear equality constraints and simple bounds …”
Volltext

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

“… In this paper, the nonlinear minimax problems with inequality constraints are discussed, and a sequential quadratic programming (SQP …”
Volltext

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

“… In this paper, we propose a continuation method for box constrained variational inequality problems …”
Volltext

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

“… : (I) Of these, the first considers linearly constrained optimization problems with an `0-norm regularization …”
Volltext

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

“… ) for solving linearly constrained convex composite optimization problems. Under a certain error bound condition, we establish the global linear rate of convergence …”
Volltext

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

“… We propose a new infeasible path-following algorithm for the convex linearly-constrained quadratic programming problem …”
Volltext