Suchergebnisse - "Abstract 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

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

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

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

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

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

Lower bound for 3-batched bin packing

Autoren: János Balogh József Békési Gábor Galambos et al.

Quelle: Discrete Optimization. 21:14-24

Schlagwörter: worst-case behavior, Combinatorial optimization, batched bin packing, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01.02. Számítás- és információtudomány, Abstract computational complexity for mathematical programming problems, lower bound, 01 natural sciences

Dateibeschreibung: application/xml; text

Zugangs-URL: https://www.sciencedirect.com/science/article/abs/pii/S1572528616300238
https://dblp.uni-trier.de/db/journals/disopt/disopt21.html#BaloghBGDT16
https://www.sciencedirect.com/science/article/pii/S1572528616300238

More on batched bin packing

Autoren: Leah Epstein

Quelle: Operations Research Letters. 44:273-277

Schlagwörter: Combinatorial optimization, bin packing, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, approximation ratio, Abstract computational complexity for mathematical programming problems, 01 natural sciences, Approximation algorithms, batched problems

Dateibeschreibung: application/xml

Zugangs-URL: https://dblp.uni-trier.de/db/journals/orl/orl44.html#Epstein16
https://www.sciencedirect.com/science/article/pii/S0167637716000274
http://www.sciencedirect.com/science/article/pii/S0167637716000274

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

Enhancing the performance of biogeography-based optimization using polyphyletic migration operator and orthogonal learning

Autoren: Dongyuan Shi Guojiang Xiong Xianzhong Duan

Quelle: Computers & Operations Research. 41:125-139

Schlagwörter: orthogonal learning, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, global numerical optimization, 02 engineering and technology, biogeography-based optimization, Abstract computational complexity for mathematical programming problems, 10. No inequality, Approximation methods and heuristics in mathematical programming, orthogonal experimental design (OED), polyphyletic migration operator, 3. Good health

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/6650568
https://doi.org/10.1016/j.cor.2013.07.021
https://dblp.uni-trier.de/db/journals/cor/cor41.html#XiongSD14
https://www.sciencedirect.com/science/article/pii/S0305054813002001
https://www.sciencedirect.com/science/article/abs/pii/S0305054813002001#!

Average-Case Competitive Analyses for Ski-Rental Problems: Average-case competitive analyses for ski-rental problems

Autoren: Fujiwara, Hiroshi Iwama, Kazuo Hiroshi Fujiwara and Kazuo Iwama

Weitere Verfasser: Fujiwara, Hiroshi Iwama, Kazuo Hiroshi Fujiwara and Kazuo Iwama

Quelle: Lecture Notes in Computer Science ISBN: 9783540001423

Schlagwörter: online algorithm, Combinatorial optimization, Analysis of algorithms and problem complexity, 0211 other engineering and technologies, competitive analysis, 0102 computer and information sciences, 02 engineering and technology, ddc:004, Abstract computational complexity for mathematical programming problems, 01 natural sciences

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2005/60/pdf/05031.FujiwaraHiroshi.ExtAbstract.60.pdf
https://zbmath.org/2168094
https://doi.org/10.1007/s00453-004-1142-x
https://link.springer.com/chapter/10.1007%2F3-540-36136-7_42
https://drops.dagstuhl.de/opus/volltexte/2005/60/pdf/05031.FujiwaraHiroshi.ExtAbstract.60.pdf
https://doi.org/10.1007/3-540-36136-7_42
http://core.ac.uk/display/24651098
https://rd.springer.com/chapter/10.1007/3-540-36136-7_42
https://link.springer.com/content/pdf/10.1007/3-540-36136-7_42.pdf
https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.8

Coordinatewise domain scaling algorithm for M-convex function minimization

Autoren: Akihisa Tamura

Quelle: Lecture Notes in Computer Science ISBN: 9783540436768

Schlagwörter: Combinatorial optimization, M-convex function minimization, 0211 other engineering and technologies, Scaling algorithm, discrete optimization, Discrete convex analysis, 0102 computer and information sciences, 02 engineering and technology, 15. Life on land, Abstract computational complexity for mathematical programming problems, nonlinear discrete functions, 01 natural sciences, 7. Clean energy

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2F3-540-47867-1_3.pdf
https://link.springer.com/chapter/10.1007%2F3-540-47867-1_3
https://dblp.uni-trier.de/db/conf/ipco/ipco2002.html#Tamura02
https://link.springer.com/content/pdf/10.1007%2F3-540-47867-1_3.pdf
https://rd.springer.com/chapter/10.1007/3-540-47867-1_3
https://doi.org/10.1007/s10107-004-0522-y
https://link.springer.com/article/10.1007%2Fs10107-004-0522-y
https://dblp.uni-trier.de/db/journals/mp/mp102.html#Tamura05
https://keio.pure.elsevier.com/ja/publications/coordinatewise-domain-scaling-algorithm-for-m-convex-function-min

Semi-on-line bin packing: a short overview and a new lower bound

Autoren: János Balogh József Békési

Quelle: Central European Journal of Operations Research. 21:685-698

Schlagwörter: Combinatorial optimization, bin packing, semi-on-line algorithms, 0211 other engineering and technologies, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), asymptotic competitive ratio, 0102 computer and information sciences, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, lower bound, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://ideas.repec.org/a/spr/cejnor/v21y2013i4p685-698.html
https://link.springer.com/article/10.1007%2Fs10100-012-0266-3
https://dblp.uni-trier.de/db/journals/cejor/cejor21.html#BaloghB13
https://doi.org/10.1007/s10100-012-0266-3
https://econpapers.repec.org/article/sprcejnor/v_3a21_3ay_3a2013_3ai_3a4_3ap_3a685-698.htm
https://link.springer.com/10.1007/s10100-012-0266-3

Time complexity of single- and identical parallel-machine scheduling with GERT network precedence constraints

Autoren: Zimmermann, Jürgen

Quelle: Mathematical Methods of Operations Research. 49:221-238

Schlagwörter: identical parallel machines, time complexity, ddc:330, Economics, Deterministic scheduling theory in operations research, stochastic scheduling, single machine, 0211 other engineering and technologies, 02 engineering and technology, GERT networks, Analysis of algorithms, Abstract computational complexity for mathematical programming problems

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1439906
https://link.springer.com/article/10.1007%2FPL00020914
https://EconPapers.repec.org/RePEc:spr:mathme:v:49:y:1999:i:2:p:221-238
https://dblp.uni-trier.de/db/journals/mmor/mmor49.html#Zimmermann99
https://ideas.repec.org/a/spr/mathme/v49y1999i2p221-238.html

Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube: Bounds on the Chvatal rank of polytopes in the 0/1-cube

Autoren: Friedrich Eisenbrand S. Schulz

Quelle: Lecture Notes in Computer Science ISBN: 9783540660194

Schlagwörter: Combinatorial optimization, Chvatal rank of polytopes, Polyhedral combinatorics, branch-and-bound, branch-and-cut, 0211 other engineering and technologies, Integer programming, 0102 computer and information sciences, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, 01 natural sciences, Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2016911
https://doi.org/10.1007/s00493-003-0020-5
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1331275
https://link.springer.com/content/pdf/10.1007/s00493-003-0020-5.pdf
https://dblp.uni-trier.de/db/conf/ipco/ipco1999.html#EisenbrandS99
http://web.mit.edu/schulz/www/epapers/es-combinatorica-2003.pdf
http://www.math.ucdavis.edu/~deloera/MISC/BIBLIOTECA/trunk/Schulz.Andreas/16100137.pdf
https://rd.springer.com/chapter/10.1007%2F3-540-48777-8_11

Simulating flows of incompressible and weakly compressible fluids on multicore hybrid computer systems

Autoren: Boris N. Chetverushkin Alexander A. Davydov E. V. Shil’nikov

Quelle: Computational Mathematics and Mathematical Physics. 50:2157-2165

Schlagwörter: Numerical algorithms for specific classes of architectures, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), stability of explicit schemes, 0101 mathematics, Abstract computational complexity for mathematical programming problems, kinetic schemes, 01 natural sciences, multicore hybrid computer systems

Dateibeschreibung: application/xml

Zugangs-URL: https://ui.adsabs.harvard.edu/abs/2010CMMPh..50.2157D/abstract
https://link.springer.com/article/10.1134/S096554251012016X

SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN: Scheduling with discretely compressible release dates to minimize makespan

Autoren: SHU-XIA ZHANG ZHI-GANG CAO YU-ZHONG ZHANG

Quelle: Asia-Pacific Journal of Operational Research. 27:493-501

Schlagwörter: 0209 industrial biotechnology, Scheduling, discretely compressible release dates, approximation algorithm, makespan, Deterministic scheduling theory in operations research, 0211 other engineering and technologies, makespan, scheduling, discretely compressible release dates, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, Approximation methods and heuristics in mathematical programming, approximation algorithm

Dateibeschreibung: application/xml

Zugangs-URL: https://www.worldscientific.com/doi/abs/10.1142/S0217595910002818
https://ideas.repec.org/a/wsi/apjorx/v27y2010i04ns0217595910002818.html
http://www.worldscinet.com/cgi-bin/details.cgi?type=pdf&id=pii:S0217595910002818
http://www.worldscinet.com/cgi-bin/details.cgi?type=html&id=pii:S0217595910002818

The inapproximability of non-NP-hard optimization problems: The inapproximability of non-NP-hard optimization problems.

Autoren: Iyad A. Kanj David W. Juedes Liming Cai

Quelle: Lecture Notes in Computer Science ISBN: 9783540653851

Schlagwörter: Computational complexity, Combinatorial optimization, Analysis of algorithms and problem complexity, Approximation hardness, Complexity classes (hierarchies, relations among complexity classes, etc.), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 0102 computer and information sciences, Abstract computational complexity for mathematical programming problems, Reductions, 01 natural sciences, Theoretical Computer Science, Computer Science(all)

Dateibeschreibung: application/xml

Zugangs-URL: https://dl.acm.org/doi/10.1016/S0304-3975%2801%2900343-7
https://www.sciencedirect.com/science/article/pii/S0304397501003437
https://dblp.uni-trier.de/db/journals/tcs/tcs289.html#CaiJK02
https://doi.org/10.1016/S0304-3975(01)00343-7
https://dblp.uni-trier.de/db/conf/isaac/isaac98.html#CaiJK98
https://rd.springer.com/chapter/10.1007/3-540-49381-6_46
https://link.springer.com/content/pdf/10.1007%2F3-540-49381-6_46.pdf
https://link.springer.com/chapter/10.1007%2F3-540-49381-6_46

Priority-based target coverage in directional sensor networks using a genetic algorithm

Autoren: Ruimin Shen Changyong Niu Jian Wang

Quelle: Computers & Mathematics with Applications. 57:1915-1922

Schlagwörter: Directional sensor network, Computational Mathematics, Computational Theory and Mathematics, priority, directional sensor network, Modelling and Simulation, Learning and adaptive systems in artificial intelligence, 0202 electrical engineering, electronic engineering, information engineering, Priority, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, Target coverage, target coverage

Dateibeschreibung: application/xml

Storage controlled pile-up systems, theoretical foundations

Autoren: Jochen Rethmann Egon Wanke

Quelle: Operations Research Proceedings ISBN: 9783540626305

Schlagwörter: Transportation, logistics and supply chain management, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology, 7. Clean energy, 12. Responsible consumption, Applications of mathematical programming, computational analysis, polynomial time algorithms, 0502 economics and business, 11. Sustainability, pile-up system, Abstract computational complexity for mathematical programming problems, NP-complete

Dateibeschreibung: application/xml

Zugangs-URL: https://rd.springer.com/chapter/10.1007/978-3-642-60744-8_21
https://ideas.repec.org/a/eee/ejores/v103y1997i3p515-530.html
https://www.sciencedirect.com/science/article/abs/pii/S0377221796003037
http://www.sciencedirect.com/science/article/pii/S0377221796003037
https://link.springer.com/chapter/10.1007/978-3-642-60744-8_21