Suchergebnisse - (abstract OR abstracts) computational complexity for mathematical programming problems

Accelerated gradient methods on the Grassmann and Stiefel manifolds

Autoren: Xiaojing Zhu

Quelle: Japan Journal of Industrial and Applied Mathematics. 42:751-786

Schlagwörter: Programming in abstract spaces, Stiefel manifold, Numerical mathematical programming methods, Nonlinear programming, accelerated gradient, global rate of convergence, Riemannian optimization, Abstract computational complexity for mathematical programming problems, Nonconvex programming, global optimization, Grassmann manifold

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/8037191
https://doi.org/10.1007/s13160-025-00692-8

Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization

Autoren: Frank E. Curtis Michael J. O’Neill Daniel P. Robinson

Quelle: Mathematical Programming. 205:431-483

Schlagwörter: Analysis of algorithms and problem complexity, 0211 other engineering and technologies, Stochastic programming, 02 engineering and technology, stochastic optimization, nonlinear optimization, sequential quadratic optimization, worst-case complexity, 49M37, 65K05, 65K10, 90C15, 90C30, 90C55, Methods of successive quadratic programming type, Complexity and performance of numerical algorithms, Numerical mathematical programming methods, Nonlinear programming, Optimization and Control (math.OC), FOS: Mathematics, Analysis of algorithms, Abstract computational complexity for mathematical programming problems, Mathematics - Optimization and Control

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2112.14799
https://zbmath.org/7829609
https://doi.org/10.1007/s10107-023-01981-1

Strongly Convergent Inertial Proximal Point Algorithm Without On-line Rule: Strongly convergent inertial proximal point algorithm without on-line rule

Autoren: Jolaoso, Lateef O. Shehu, Yekini Yao, Jen-Chih

Quelle: Journal of Optimization Theory and Applications. 200:555-584

Schlagwörter: strong convergence, Hilbert spaces, Convex programming, Discrete approximations in optimal control, Nonlinear programming, Analysis of algorithms and problem complexity, Semidefinite programming, maximal monotone operators, two-point inertia, Abstract computational complexity for mathematical programming problems, proximal point algorithm

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/7802200
https://doi.org/10.1007/s10957-023-02355-5

On the complexity of recognizing integrality and total dual integrality of the {0,1/2}-closure: On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure

Autoren: Matthias Brugger Andreas S. Schulz

Quelle: Operations Research Letters. 50:16-19

Schlagwörter: FOS: Computer and information sciences, computational complexity, Discrete Mathematics (cs.DM), integrality, \(\{0, 1 / 2 \}\)-cuts, 0211 other engineering and technologies, Integer programming, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Optimization and Control (math.OC), Gomory-chvátal cuts, Polyhedral combinatorics, branch-and-bound, branch-and-cut, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Abstract computational complexity for mathematical programming problems, Mathematics - Optimization and Control, total dual integrality, Computer Science - Discrete Mathematics

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/pdf/2104.14486
http://arxiv.org/abs/2104.14486
https://arxiv.org/pdf/2104.14486
https://arxiv.org/abs/2104.14486
https://dblp.uni-trier.de/db/journals/corr/corr2104.html#abs-2104-14486
https://www.sciencedirect.com/science/article/pii/S0167637721001693

Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models: Stochastic trust-region methods with trust-region radius depending on probabilistic models

Autoren: Wang, Xiaoyu Yuan, Yaxiang

Quelle: Journal of Computational Mathematics. 40:294-334

Schlagwörter: Numerical optimization and variational techniques, probabilistic models, Stochastic optimization, 0211 other engineering and technologies, 02 engineering and technology, stochastic optimization, Global convergence, trust-region methods, global convergence, trust-region radius, Numerical mathematical programming methods, Optimization and Control (math.OC), Trust-region methods, Trust- region radius, FOS: Mathematics, Probabilistic models, Abstract computational complexity for mathematical programming problems, Mathematics - Optimization and Control, 65K05, 65K10, 90C60

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/pdf/1904.03342
http://arxiv.org/abs/1904.03342

Embedding Complexity and Discrete Optimization II: A Dynamical Programming Approach to the Steiner-Tree Problem: Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem

Autoren: Cieslik, D. Dress, A. Huber, K. T. et al.

Quelle: Annals of Combinatorics. 6:275-283

Schlagwörter: dynamic programming, Extremal problems in graph theory, Combinatorial optimization, computational complexity, algorithmic complexity, Steiner's problem, structural complexity, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, Dynamic programming, 01 natural sciences, 7. Clean energy, Steiner minimal trees, Trees, embedding complexity, Graph theory (including graph drawing) in computer science, treewidth, divide and conquer, discrete optimization, Abstract computational complexity for mathematical programming problems

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1964604
https://doi.org/10.1007/s000260200003
http://core.ac.uk/display/2770606
https://link.springer.com/content/pdf/10.1007/s000260200003.pdf
https://link.springer.com/article/10.1007/s000260200003
https://ueaeprints.uea.ac.uk/id/eprint/23324/
https://research-portal.uea.ac.uk/en/publications/embedding-complexity-and-discrete-optimization-ii-a-dynamical-pro

Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity

Autoren: Chengxian Xu Shanglu He

Quelle: Science in China Series A: Mathematics. 44:338-344

Schlagwörter: polynomial-time complexity, uniform \(P\)-function, infeasible-interior-point algorithm, 0211 other engineering and technologies, complementarity problem, Interior-point methods, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1782091
https://doi.org/10.1007/bf02878714
https://link.springer.com/content/pdf/10.1007/BF02878714.pdf
https://link.springer.com/article/10.1007/BF02878714
https://ui.adsabs.harvard.edu/abs/2001ScChA..44..338H/abstract

Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints: Computational complexity of some maximum average weight problems with precedence constraints

Autoren: Ulrich Faigle Walter Kern

Quelle: Operations Research. 42:688-693

Schlagwörter: learning, tree-structured attributes, 0211 other engineering and technologies, Integer programming, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, Abstract computational complexity for mathematical programming problems, 01 natural sciences, maximum average weight, NP-complete

Dateibeschreibung: application/xml

Zugangs-URL: https://ris.utwente.nl/ws/files/6852520/Faigle94computational.pdf
https://zbmath.org/710922
https://doi.org/10.1287/opre.42.4.688
https://research.utwente.nl/en/publications/fcb5a027-eca4-46df-9ece-52f60505272b
https://doi.org/10.1287/opre.42.4.688

Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem: Computational complexity of a cost allocation approach to a fixed cost spanning forest problem

Autoren: Frieda Granot Daniel Granot

Quelle: Mathematics of Operations Research. 17:765-780

Schlagwörter: facility location, 0211 other engineering and technologies, core, undirected connected graph, 02 engineering and technology, Programming involving graphs or networks, fixed cost spanning forest game, Resource and cost allocation (including fair division, apportionment, etc.), Discrete location and assignment, Other game-theoretic models, Cooperative games, fixed cost spanning forest problem, nucleolus, Abstract computational complexity for mathematical programming problems

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/126117
https://doi.org/10.1287/moor.17.4.765
https://www.jstor.org/stable/3690069
https://ideas.repec.org/a/inm/ormoor/v17y1992i4p765-780.html
https://econpapers.repec.org/RePEc:inm:ormoor:v:17:y:1992:i:4:p:765-780
https://dblp.uni-trier.de/db/journals/mor/mor17.html#GranotG92
https://pubsonline.informs.org/doi/abs/10.1287/moor.17.4.765

The controlled rounding problem: Complexity and computational experience

Autoren: Bruce L. Golden James P. Kelly Arjang A. Assad

Quelle: European Journal of Operational Research. 65:207-217

Schlagwörter: statistical disclosure, 0211 other engineering and technologies, heuristics, 02 engineering and technology, Applications of statistics, 01 natural sciences, censoring, tree-dimensional problem, controlled rounding, Linear programming, Sampling theory, sample surveys, Deterministic network models in operations research, agencies, statistical enclosure, 0101 mathematics, Abstract computational complexity for mathematical programming problems, two- dimensional tables, binary search procedures, anonymity, government, Integer programming, Programming involving graphs or networks, data integrity, Applications of mathematical programming, simulated annealing, census organizations

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/404922
https://doi.org/10.1016/0377-2217(93)90334-j
https://www.sciencedirect.com/science/article/pii/037722179390334J
http://www.sciencedirect.com/science/article/pii/037722179390334J
https://ideas.repec.org/a/eee/ejores/v65y1993i2p207-217.html

On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems: On the complexity of determining tolerances for \(\varepsilon\)-optimal solutions to min-max combinatorial optimization problems

Autoren: Ghosh, Diptesh Sierksma, G.

Quelle: Applicationes Mathematicae. 30:305-313

Schlagwörter: Combinatorial optimization, Epsilon-Optimal Solutions, Tolerances, min-max, 01 natural sciences, sensitivity analysis, Optimaliseren, 31.12, Sensitivity, stability, parametric optimization, 0101 mathematics, Combinatieleer, Abstract computational complexity for mathematical programming problems, complexity, 0-1 combinatorial optimization problems

Dateibeschreibung: application/xml

Zugangs-URL: https://www.impan.pl/shop/publication/transaction/download/product/84031?download.pdf
https://zbmath.org/2120086
https://doi.org/10.4064/am30-3-5
https://research.rug.nl/en/publications/ffc140bc-5c73-4110-a7aa-b1eaa49742a1
https://hdl.handle.net/11370/ffc140bc-5c73-4110-a7aa-b1eaa49742a1
https://research.rug.nl/en/publications/04d94fad-a3bb-4c7a-ba39-5ca594fe8369
https://hdl.handle.net/11370/04d94fad-a3bb-4c7a-ba39-5ca594fe8369
https://pure.rug.nl/ws/files/3129277/00a35.pdf
https://research.rug.nl/en/publications/on-the-complexity-of-determining-tolerances-for-e-optimal-solutio
https://www.rug.nl/research/portal/publications/on-the-complexity-of-determining-tolerances-for-eoptimal-solutions-to-minmax-combinatorial-optimization-problems(ffc140bc-5c73-4110-a7aa-b1eaa49742a1)/export.html
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.bwnjournal-article-doi-10_4064-am30-3-5
https://dialnet.unirioja.es/servlet/articulo?codigo=3450443
https://www.impan.pl/pl/wydawnictwa/czasopisma-i-serie-wydawnicze/applicationes-mathematicae/all/30/3/84031/on-the-complexity-of-determining-tolerances-for-varepsilon-optimal-solutions-to-min-max-combinatorial-optimization-problems
http://irs.ub.rug.nl/ppn/240570340

New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior

Autoren: Algirdas Laninskas Julius Ilinskas Blas Pelegrn et al.

Quelle: Computers & Operations Research. 79:12-18

Schlagwörter: competitive location, Discrete location and assignment, 0211 other engineering and technologies, heuristic algorithm, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, 16. Peace & justice, Approximation methods and heuristics in mathematical programming, binary and partially binary rules

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/abs/pii/S0305054816302507
http://www.sciencedirect.com/science/article/pii/S0305054816302507
https://dblp.uni-trier.de/db/journals/cor/cor79.html#FernandezPLZ17

Augmented self-concordant barriers and nonlinear optimization problems with finite complexity

Autoren: J.-Ph. Vial Yu. Nesterov

Quelle: Mathematical Programming. 99:149-174

Schlagwörter: finite polynomial complexity, Nonlinear programming, 0211 other engineering and technologies, 02 engineering and technology, 0101 mathematics, Abstract computational complexity for mathematical programming problems, barrier function, nonlinear optimization, 01 natural sciences, central path

Dateibeschreibung: application/xml

Zugangs-URL: https://archive-ouverte.unige.ch/unige:5851/ATTACHMENT01
https://dial.uclouvain.be/handle/boreal:40497
http://www.optimization-online.org/DB_FILE/2001/06/346.pdf
https://dblp.uni-trier.de/db/journals/mp/mp99.html#NesterovV04
https://link.springer.com/article/10.1007/s10107-003-0392-8
https://archive-ouverte.unige.ch/unige:5851/ATTACHMENT01
https://archive-ouverte.unige.ch/unige:5851

ON COMPUTATIONAL COMPLEXITY OF HIERARCHICAL OPTIMIZATION: On computational complexity of hierarchical optimization

Autoren: Weijia Jia Zhibin Sun

Quelle: International Journal of Foundations of Computer Science. 13:667-670

Schlagwörter: Combinatorial optimization, Complexity and performance of numerical algorithms, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, \(n\)-person games, \(n>2\), 02 engineering and technology, 0101 mathematics, Abstract computational complexity for mathematical programming problems, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/journals/ijfcs/ijfcs13.html#JiaS02
https://www.worldscientific.com/doi/abs/10.1142/S0129054102001369

Scheduling jobs of equal length: Complexity, facets and computational results

Autoren: Crama, Yves Spieksma, Frits C.R.

Quelle: Lecture Notes in Computer Science ISBN: 9783540594086

Schlagwörter: Business & economic sciences, computational complexity, Deterministic scheduling theory in operations research, single machine, automated assembly of printed circuit boards, 0211 other engineering and technologies, Quantitative methods in economics & management, 02 engineering and technology, polyhedral description, cutting plane algorithm, Méthodes quantitatives en économie & gestion, Polyhedral description, Production, distribution & gestion de la chaîne logistique, 8. Economic growth, scheduling, Production, distribution & supply chain management, Abstract computational complexity for mathematical programming problems, Sciences économiques & de gestion

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/article/10.1007%2FBF02592090
https://dblp.uni-trier.de/db/journals/mp/mp72.html#CramaS96
https://orbi.uliege.be/handle/2268/202812
https://rd.springer.com/chapter/10.1007/3-540-59408-6_58
https://dblp.uni-trier.de/db/conf/ipco/ipco1995.html#CramaS95
https://link.springer.com/chapter/10.1007%2F978-3-642-80270-6_4
https://core.ac.uk/display/22086918
https://hdl.handle.net/2268/202812
https://doi.org/10.1007/BF02592090

Cardinality constrained minimum cut problems: complexity and algorithms: Cardinality constrained minimum cut problems: complexity and algorithms.

Autoren: BRUGLIERI, MAURIZIO MAFFIOLI, FRANCESCO EHRGOTT M.

Quelle: Discrete Applied Mathematics. 137:311-341

Schlagwörter: Combinatorial optimization, Cut problems, k-cardinality minimum cut, Cardinality constrained combinatorial optimization, Cardinality, Applied Mathematics, 0211 other engineering and technologies, Cardinality constrained combinatorial optimization, Integer programming, 0102 computer and information sciences, 02 engineering and technology, Cut problems, 01 natural sciences, Computational complexity, k-cardinality minimum cut, Discrete Mathematics and Combinatorics, Semidefinite programming, Abstract computational complexity for mathematical programming problems, constrained combinatorial optimization, \(k\)-cardinality minimum cut

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://www.sciencedirect.com/science/article/abs/pii/S0166218X03003585
https://www.sciencedirect.com/science/article/pii/S0166218X03003585
https://dblp.uni-trier.de/db/journals/dam/dam137.html#BruglieriME04
https://dl.acm.org/doi/10.1016/S0166-218X%2803%2900358-5
https://hdl.handle.net/11311/555764

Complexity of the Gravitational Method for Linear Programming: Complexity of the gravitational method for linear programming

Autoren: Z. Zhang Nagabhushana Prabhu T. L. Morin

Quelle: Lecture Notes in Computer Science ISBN: 9783540620341

Schlagwörter: linear program, Linear programming, 4. Education, worst-case analysis, gravitational method, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, simplex method, complexity, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1638133
https://doi.org/10.1023/a:1017591509792
https://rd.springer.com/chapter/10.1007%2F3-540-62034-6_51
https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs96.html#MorinPZ96
https://link.springer.com/chapter/10.1007/3-540-62034-6_51
https://ideas.repec.org/a/spr/joptap/v108y2001i3d10.1023_a1017591509792.html
https://link.springer.com/article/10.1023/A:1017591509792
https://link.springer.com/content/pdf/10.1023/A:1017591509792.pdf

On the complexity of a class of combinatorial optimization problems with uncertainty

Autoren: Igor Averbakh

Quelle: Mathematical Programming. 90:263-272

Schlagwörter: Combinatorial optimization, computational complexity, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Stochastic programming, robust optimization, 02 engineering and technology, minmax regret, Abstract computational complexity for mathematical programming problems

Dateibeschreibung: application/xml

Note on the computational complexity of least core concepts for min-cost spanning tree games: Note on the computational complexity of least core concepts for min-cost spanning tree games.

Autoren: Faigle, U. Kern, W. Paulusma, Daniel

Quelle: Mathematical methods of operations research, 2000, Vol.52(1), pp.23-38 [Peer Reviewed Journal]

Schlagwörter: Spanning tree, least core, 0211 other engineering and technologies, Nucleolus, IR-85186, 02 engineering and technology, NP-hard, 01 natural sciences, cooperative games, METIS-140627, Cooperative games, Least core, nucleolus, 0101 mathematics, Abstract computational complexity for mathematical programming problems, Cooperative game

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: http://dro.dur.ac.uk/6122/1/6122.pdf
https://zbmath.org/1972726
https://doi.org/10.1007/s001860000059
https://research.utwente.nl/en/publications/5d656242-ea14-44f5-b8bf-a17cb4119218
https://doi.org/10.1007/s001860000059

On the complexity of the k-customer vehicle routing problem: On the complexity of the \(k\)-customer vehicle routing problem

Autoren: Refael Hassin Shlomi Rubinstein

Quelle: Operations Research Letters. 33:71-76

Schlagwörter: Vehicle routing problem, 0211 other engineering and technologies, 02 engineering and technology, Programming involving graphs or networks, Abstract computational complexity for mathematical programming problems, Approximation algorithms

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2116853
https://doi.org/10.1016/j.orl.2004.04.003
https://www.sciencedirect.com/science/article/pii/S0167637704000513
https://dl.acm.org/doi/10.1016/j.orl.2004.04.003
https://dblp.uni-trier.de/db/journals/orl/orl33.html#HassinR05