Suchergebnisse - Linearly constrained quadratic optimization problems with complementarity constraints

Bounds for a Class of Quadratic Optimization Problems

Autoren: Sunyoung Kim Masakazu Kojima Kim-chuan Toh et al.

Weitere Verfasser: Sunyoung Kim Masakazu Kojima Kim-chuan Toh et al.

Quelle: http://www.is.titech.ac.jp/~kojima/articles/B-472.pdf.

Schlagwörter: Linearly constrained quadratic optimization problems with complementarity constraints

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.431.7372

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.431.7372
http://www.is.titech.ac.jp/~kojima/articles/B-472.pdf

A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems.

Autoren: Kim, Sunyoung Kojima, Masakazu Toh, Kim-Chuan

Quelle: Mathematical Programming; Mar2016, Vol. 156 Issue 1/2, p161-187, 27p

Schlagwörter: LAGRANGIAN functions, MATHEMATICAL bounds, MATHEMATICAL optimization, QUADRATIC equations, NONNEGATIVE matrices

Conic formulation of QPCCs applied to truly sparse QPs.

Autoren: Bomze, Immanuel M. Peng, Bo

Quelle: Computational Optimization & Applications; Apr2023, Vol. 84 Issue 3, p703-735, 33p

Schlagwörter: COMPLEMENTARITY constraints (Mathematics)

On conic QPCCs, conic QCQPs and completely positive programs.

Autoren: Bai, Lijie Mitchell, John Pang, Jong-Shi

Quelle: Mathematical Programming; Sep2016, Vol. 159 Issue 1/2, p109-136, 28p

Schlagwörter: QUADRATIC programming, COMPLEMENTARITY constraints (Mathematics), CONSTRAINED optimization, NONCONVEX programming, CONVEX functions

An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization.

Autoren: Wu, Zeguan Mohammadisiahroudi, Mohammadhossein Augustino, Brandon et al.

Quelle: Entropy; Feb2023, Vol. 25 Issue 2, p330, 21p

Schlagwörter: CONSTRAINED optimization, INTERIOR-point methods, SUPPORT vector machines, QUANTUM computers, LINEAR systems, QUANTUM noise

Newton-type methods for constrained optimization with nonregular constraints.

Autoren: Golishnikov, M. Izmailov, A.

Quelle: Computational Mathematics & Mathematical Physics; Aug2006, Vol. 46 Issue 8, p1299-1319, 21p

Conic approximation to quadratic optimization with linear complementarity constraints.

Autoren: Zhou, Jing Fang, Shu-Cherng Xing, Wenxun

Quelle: Computational Optimization & Applications; Jan2017, Vol. 66 Issue 1, p97-122, 26p

Schlagwörter: COMPLEMENTARITY constraints (Mathematics), MATHEMATICAL optimization, APPROXIMATION theory, MATHEMATICAL bounds, MATHEMATICAL reformulation

A Semidefinite Programming Heuristic for Quadratic Programming Problems with Complementarity Constraints.

Autoren: Braun, Stephen Mitchell, John E.

Quelle: Computational Optimization & Applications; May2005, Vol. 31 Issue 1, p5-29, 25p, 8 Diagrams, 5 Charts, 2 Graphs

Schlagwörter: HEURISTIC programming, ARTIFICIAL intelligence, MATHEMATICAL programming, QUADRATIC programming, NONLINEAR programming, LINEAR complementarity problem, MATHEMATICAL optimization, MATHEMATICAL analysis

Bilevel Imaging Learning Problems as Mathematical Programs with Complementarity Constraints: Reformulation and Theory.

Autoren: Carlos De los Reyes, Juan

Quelle: SIAM Journal on Imaging Sciences; 2023, Vol. 16 Issue 3, p1655-1686, 32p

B-475 Lagrangian-Conic Relaxations, Part I: A Unified Framework and Its Applications to Quadratic Optimization Problems

Autoren: Naohiko Arima Sunyoung Kim Masakazu Kojima et al.

Weitere Verfasser: Naohiko Arima Sunyoung Kim Masakazu Kojima et al.

Quelle: http://www.is.titech.ac.jp/~kojima/articles/B-475.pdf.

Schlagwörter: sparsity

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.642.1677

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.642.1677
http://www.is.titech.ac.jp/~kojima/articles/B-475.pdf

Splitting methods for quadratic optimization in data analysis

Autoren: GALLIGANI, Emanuele V. RUGGIERO ZANNI, Luca

Quelle: International Journal of Computer Mathematics. 63:289-307

Schlagwörter: Bivariate interpolation, Diagonalization method, Large scale problem, Linearly constrained strictly convex quadratic program, Splitting method, Vector computer, 0211 other engineering and technologies, 02 engineering and technology, 0101 mathematics, linearly constrained strictly convex quadratic program, large scale problem, splitting method, diagonalization method, bivariate interpolation, vector computer, 01 natural sciences

Zugangs-URL: https://core.ac.uk/display/53980086
https://doi.org/10.1080/00207169708804568
http://www.nau.unimore.it/IJCM-1997.pdf
https://www.tandfonline.com/doi/abs/10.1080/00207169708804568
https://hdl.handle.net/11380/613243
https://hdl.handle.net/11392/1207851
https://doi.org/10.1080/00207169708804568

Inexact Josephy–Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization.

Autoren: Izmailov, A. F. Solodov, M. V.

Quelle: Computational Optimization & Applications. Jun2010, Vol. 46 Issue 2, p347-368. 22p.

Schlagwörter: *MATHEMATICAL optimization, *NONLINEAR programming, *STOCHASTIC convergence, QUADRATIC programming, LINEAR dependence (Mathematics)

Extension of Quasi-Newton Methods to Mathematical Programs with Complementarity Constraints.

Autoren: Jiang, Houyuan Ralph, Daniel

Quelle: Computational Optimization & Applications; Apr-Sep2003, Vol. 25 Issue 1-3, p123-150, 28p

Schlagwörter: QUASI-Newton methods, CONSTRAINT satisfaction, MATHEMATICAL programming, MATHEMATICAL models, PROBLEM solving, STOCHASTIC convergence

Limiting behavior of the central path in semidefinite optimization.

Autoren: Halická, M. de Klerk, E. Roos, C.

Quelle: Optimization Methods & Software; Feb2005, Vol. 20 Issue 1, p99-113, 15p

Schlagwörter: COINCIDENCE theory, STOCHASTIC convergence, MATHEMATICAL optimization, MATHEMATICAL functions, FIXED point theory, TOPOLOGY

On Squared-Variable Formulations.

Autoren: Ding, Lijun Wright, Stephen J.

Quelle: SIAM Journal on Optimization; 2025, Vol. 35 Issue 4, p2265-2293, 29p

Schlagwörter: CONSTRAINED optimization, LINEAR programming, COMPUTATIONAL complexity, LAGRANGE multiplier, ALGORITHMS, QUADRATIC equations

A Partially Feasible Jacobi-Type Distributed SQO Method for Two-Block General Linearly Constrained Smooth Optimization.

Autoren: Jian, Jinbao Chen, Wenrui Tang, Chunming et al.

Quelle: Journal of Scientific Computing; Feb2025, Vol. 102 Issue 2, p1-39, 39p

Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming.

Autoren: Mehlitz, Patrick

Quelle: Optimization; Jan2023, Vol. 72 Issue 1, p277-320, 44p

Schlagwörter: BILEVEL programming, NONLINEAR equations, CONSTRAINED optimization, COMPLEMENTARITY constraints (Mathematics), NONSMOOTH optimization

SEQUENTIAL LINEARIZATION METHOD FOR BOUND-CONSTRAINED MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS.

Autoren: KIRCHES, CHRISTIAN LARSON, JEFFREY LEYFFER, SVEN et al.

Quelle: SIAM Journal on Optimization; 2022, Vol. 32 Issue 1, p75-99, 25p

Schlagwörter: LINEAR complementarity problem, NUMERICAL analysis, CONSTRAINED optimization, LINEAR programming

Optimization over convex polyhedra via Hadamard parametrizations.

Autoren: Tang, Tianyun Toh, Kim-Chuan

Quelle: Mathematical Programming; Nov2025, Vol. 214 Issue 1/2, p91-131, 41p

Schlagwörter: MATHEMATICAL optimization, OPTIMIZATION algorithms, POLYHEDRA, HADAMARD matrices, RIEMANNIAN manifolds, TANGENT bundles, LAGRANGE multiplier

OPTIMALITY CONDITIONS AND NUMERICAL ALGORITHMS FOR A CLASS OF LINEARLY CONSTRAINED MINIMAX OPTIMIZATION PROBLEMS.

Autoren: YU-HONG DAI JIANI WANG LIWEI ZHANG

Quelle: SIAM Journal on Optimization; 2024, Vol. 34 Issue 3, p2883-2916, 34p

Schlagwörter: ABSOLUTE value, LINEAR equations, ALGORITHMS, EQUATIONS