Suchergebnisse - Convex quadratic programming Convex quadratically constrained programming*

A new convex relaxation for quadratically constrained quadratic programming

Autoren: Wu, Duzhi Hu, Aiping Zhou, Jie et al.

Quelle: Filomat, 2013 Jan 01. 27(8), 1511-1521.

Zugangs-URL: https://www.jstor.org/stable/24896489

Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method

Weitere Verfasser: Mehrotra, Sanjay [Northwestern Univ., Evanston, IL (United States)]

Quelle: INFORMS Journal on Computing; 29; 1

Dateibeschreibung: Medium: ED; Size: p. 36-53

Zugangs-URL: http://www.osti.gov/scitech/servlets/purl/1321136

Preventive-Corrective Control for Static Voltage Stability Under Multiple $N-1$ Contingencies Considering Wind Power Uncertainty

Autoren: Yuerong Yang Shunjiang Lin Qiong Wang et al.

Quelle: CSEE Journal of Power and Energy Systems, Vol 11, Iss 4, Pp 1466-1480 (2025)

Schlagwörter: Multiple $N-1$ contingencies, preventive-corrective control, probabilistic distribution control, sequential convex quadratically constrained quadratic programming, static voltage stability margin, wind power uncertainty, Technology, Physics, QC1-999

Dateibeschreibung: electronic resource

Relation: https://ieeexplore.ieee.org/document/10520197/; https://doaj.org/toc/2096-0042

Zugangs-URL: https://doaj.org/article/6d24b583730746d69662edf457a00976

A Method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs

Autoren: Mehrotra, Sanjay Sun, Jie

Quelle: SIAM Journal on Numerical Analysis, 1991 Apr 01. 28(2), 529-544.

Zugangs-URL: https://www.jstor.org/stable/2157827

Convex Quadratic Programming for Computing Geodesic Distances on Triangle Meshes

Autoren: Shuangmin Chen Nailei Hei Shun Hu et al.

Quelle: Mathematics, Vol 12, Iss 7, p 993 (2024)

Schlagwörter: digital geometry processing, geodesic distance field, convex quadratic programming (CQP), Mathematics, QA1-939

Dateibeschreibung: electronic resource

Relation: https://www.mdpi.com/2227-7390/12/7/993; https://doaj.org/toc/2227-7390

Zugangs-URL: https://doaj.org/article/26ac763117ca4a41949634b352d4bb8e

On the Sequential Quadratically Constrained Quadratic Programming Methods

Autoren: Solodov, M. V.

Quelle: Mathematics of Operations Research, 2004 Feb 01. 29(1), 64-79.

Zugangs-URL: https://www.jstor.org/stable/30035632

Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method. http://www.optimization-online.org/DB HTML/2012/04/3431.html

Autoren: Kuo-ling Huang Sanjay Mehrotra The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Kuo-ling Huang Sanjay Mehrotra The Pennsylvania State University CiteSeerX Archives

Quelle: http://users.iems.northwestern.edu/%7Emehrotra/TechnicalReports/HomogeneousCP_Main.pdf.

Schlagwörter: Key words. quadratic programs, quadratically constrained quadratic programs, convex pro- grams, homogeneous algorithms, interior point methods

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.685.8472; http://users.iems.northwestern.edu/%7Emehrotra/TechnicalReports/HomogeneousCP_Main.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.685.8472
http://users.iems.northwestern.edu/%7Emehrotra/TechnicalReports/HomogeneousCP_Main.pdf

Survey of sequential convex programming and generalized Gauss-Newton methods

Autoren: Messerer Florian Baumgärtner Katrin Diehl Moritz

Quelle: ESAIM: Proceedings and Surveys, Vol 71, Pp 64-88 (2021)

Schlagwörter: Applied mathematics. Quantitative methods, T57-57.97, Mathematics, QA1-939

Dateibeschreibung: electronic resource

Relation: https://www.esaim-proc.org/articles/proc/pdf/2021/02/proc2107107.pdf; https://doaj.org/toc/2267-3059

Zugangs-URL: https://doaj.org/article/6ccd6f6410c34349a83f2a06c20c9eaf

A Convex Approximation for Optimal DER Scheduling on Unbal-anced Power Distribution Networks

Autoren: Iván David Serna-Suárez

Quelle: Dyna, Vol 86, Iss 208, Pp 281-291 (2019)

Schlagwörter: Optimal power flow, power distribution networks, DER scheduling, Quadratic Constrained Quadratic Programming, renewable energy, storage systems, Technology, Mining engineering. Metallurgy, TN1-997

Dateibeschreibung: electronic resource

Relation: https://revistas.unal.edu.co/index.php/dyna/article/view/72886; https://doaj.org/toc/0012-7353; https://doaj.org/toc/2346-2183

Zugangs-URL: https://doaj.org/article/e3769168bbd848419efdcdd2326d3854

Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method.

Autoren: Huang, Kuo-Ling Mehrotra, Sanjay

Quelle: INFORMS Journal on Computing. Winter2017, Vol. 29 Issue 1, p36-53. 18p.

Schlagwörter: *INTERIOR-point methods, *CONVEX programming, *LIPSCHITZ spaces, *POLYNOMIAL time algorithms, *QUADRATIC programming

A path-following algorithm for stochastic quadratically constrained convex quadratic programming in a Hilbert space.

Autoren: Oulha, Amira Achouak Alzalg, Baha

Quelle: Communications in Combinatorics & Optimization; 2024, Vol. 9 Issue 2, p353-387, 35p

Schlagwörter: HILBERT space, STOCHASTIC analysis, STOCHASTIC control theory, INTERIOR-point methods, CONSTRAINED optimization

Convex Quadratic Programming for Computing Geodesic Distances on Triangle Meshes.

Autoren: Chen, Shuangmin Hei, Nailei Hu, Shun et al.

Quelle: Mathematics (2227-7390); Apr2024, Vol. 12 Issue 7, p993, 19p

Schlagwörter: GEODESIC distance, LINEAR programming, COMPUTER graphics, CONVEX programming, QUADRATIC programming, TRIANGLES, CUSP forms (Mathematics), GEODESICS

Global solution of non-convex quadratically constrained quadratic programs.

Autoren: Elloumi, Sourour Lambert, Amélie

Quelle: Optimization Methods & Software; Feb2019, Vol. 34 Issue 1, p98-114, 17p

Schlagwörter: GLOBAL optimization, NONCONVEX programming, QUADRATIC programming, MATHEMATICAL bounds, ALGORITHMS

Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems.

Autoren: Zhang, Bo Gao, YueLin Liu, Xia et al.

Quelle: Journal of Global Optimization; May2023, Vol. 86 Issue 1, p61-92, 32p

Schlagwörter: NONCONVEX programming, APPROXIMATION algorithms, SCIENTIFIC communication, QUADRATIC programming, OPTIMIZATION algorithms, GLOBAL optimization

A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints.

Autoren: Osmanpour, Naser Keyanpour, Mohammad

Quelle: Optimization; Dec2022, Vol. 71 Issue 14, p4107-4123, 17p

Schlagwörter: QUADRATIC programming, CONVEX functions, NONLINEAR equations, FRACTIONAL programming, PROBLEM solving

Modeling side slopes in vertical alignment resource road construction using convex optimization.

Autoren: Momo, Nusrat Suzana Hare, Warren Lucet, Yves

Quelle: Computer-Aided Civil & Infrastructure Engineering; Jan2023, Vol. 38 Issue 2, p211-224, 14p

Schlagwörter: ROAD construction, EARTHWORK, LINEAR programming, QUADRATIC programming, INTEGER programming

Penalized semidefinite programming for quadratically-constrained quadratic optimization.

Autoren: Madani, Ramtin Kheirandishfard, Mohsen Lavaei, Javad et al.

Quelle: Journal of Global Optimization; Nov2020, Vol. 78 Issue 3, p423-451, 29p

Schlagwörter: QUADRATIC programming, SEMIDEFINITE programming, NONCONVEX programming, SYSTEM identification, BENCHMARK problems (Computer science)

基于统一潮流控制器的负序抑制最优潮流算法. (Chinese)

Alternate Title: Optimal power flow algorithm with negative‑sequence suppression based on unified power flow controller. (English)

Autoren: 陈 谦 陈杉桐 张 裕 et al.

Quelle: Journal of Electric Power Science & Technology; Jan2025, Vol. 40 Issue 1, p47-54, 8p

Schlagwörter: INTERIOR-point methods, ELECTRICAL load, QUADRATIC programming, RENEWABLE energy sources, SYSTEM safety

Interval convex quadratic programming problems in a general form.

Autoren: Hladík, Milan

Quelle: Central European Journal of Operations Research; Sep2017, Vol. 25 Issue 3, p725-737, 13p

Schlagwörter: QUADRATIC programming, INTERVAL analysis, CONVEX domains, PERTURBATION theory, MATHEMATICAL variables

A Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic Programming.

Autoren: Zheng-Hai Huang Defeng Sun Gongyun Zhao

Quelle: Computational Optimization & Applications; Oct2006, Vol. 35 Issue 2, p199-237, 39p, 2 Charts

Schlagwörter: ALGORITHMS, QUADRATIC programming, LINEAR complementarity problem, MATHEMATICAL programming, NONLINEAR programming, LINEAR programming, SMOOTHING (Numerical analysis), MATHEMATICAL analysis, MATHEMATICAL optimization