Suchergebnisse - (("programming in abstract spaces") OR ("Programming in abstraktu space"))~

Convex Parametric Programming in Abstract Spaces.

Autoren: Asgharian, M. Zlobec, S.

Quelle: Optimization. Dec2002, Vol. 51 Issue 6, p841. 21p.

Schlagwörter: *CONVEX programming, *CONVEX sets

Sensitivity Analysis for Convex Multiobjective Programming in Abstract Spaces

Autoren: Balbás, A. Guerra, P.Jiménez

Quelle: Journal of Mathematical Analysis and Applications ; volume 202, issue 2, page 645-658 ; ISSN 0022-247X

Verfügbarkeit: http://dx.doi.org/10.1006/jmaa.1996.0339
https://api.elsevier.com/content/article/PII:S0022247X9690339X?httpAccept=text/xml
https://api.elsevier.com/content/article/PII:S0022247X9690339X?httpAccept=text/plain

Convergence and Approximation of Optimization Problems: Convergence and approximation of optimization problems

Autoren: Onésimo Hernández-Lerma Jorge Alvarez-Mena

Quelle: SIAM Journal on Optimization. 15:527-539

Schlagwörter: Programming in abstract spaces, general capacity problem, Sensitivity, stability, parametric optimization, minimization problem, 0211 other engineering and technologies, 02 engineering and technology, Sensitivity, stability, well-posedness, 0101 mathematics, approximation, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2206189
https://doi.org/10.1137/s1052623402413938
https://dblp.uni-trier.de/db/journals/siamjo/siamjo15.html#Alvarez-MenaH05
https://epubs.siam.org/doi/pdf/10.1137/S1052623402413938
https://locus.siam.org/doi/abs/10.1137/S1052623402413938

abstract convexity in measure theory and in convex analysis: Abstract convexity in measure theory and in convex analysis.

Autoren: V. L. Levin

Quelle: Journal of Mathematical Sciences. 116(4):3432-3467

Schlagwörter: Programming in abstract spaces, Convex programming, abstract convexity, Functional analytic lifting theory, Lifting theory, Nonsmooth analysis, Variational problems in a geometric measure-theoretic setting, mass transportation, lifting

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2094859
https://doi.org/10.1023/a:1024033523973
https://rd.springer.com/article/10.1023/a:1024033523973
http://mathecon.cemi.rssi.ru/vlevin/files/JMS2003.pdf
https://link.springer.com/article/10.1023%2FA%3A1024033523973

notions of relative interior in banach spaces: Notions of relative interior in Banach spaces

Autoren: Borwein, J. Goebel, R.

Quelle: Journal of Mathematical Sciences. 115(4):2542-2553

Schlagwörter: Programming in abstract spaces, Banach spaces, topology, Geometry and structure of normed linear spaces, calculus, complex variables, convex domains, Set-valued and variational analysis

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1981999
https://doi.org/10.1023/a:1022988116044
https://link.springer.com/article/10.1023/A:1022988116044

rank 1 representers: Rank-1 representers

Autoren: Andrew Eberhard Daniel Ralph

Quelle: Journal of Mathematical Sciences. 115(5):2653-2700

Schlagwörter: Normed linear spaces and Banach spaces, Banach lattices, Programming in abstract spaces, separation-like properties, Measures, integration, derivative, holomorphy (all involving infinite-dimensional spaces), Applications of functional analysis in optimization, convex analysis, mathematical programming, economics, rank-1 and plenary subsets of continuous operators between Banach spaces, Nonsmooth analysis, symmetric rank-1 supports

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1982009
https://doi.org/10.1023/a:1023248501932
https://link.springer.com/article/10.1023/A%3A1023248501932
https://link.springer.com/content/pdf/10.1023/A:1023248501932.pdf

φ convex functions defined on metric spaces: \(\Phi\)-convex functions defined on metric spaces

Autoren: S. Rolewicz

Quelle: Journal of Mathematical Sciences. 115(5):2631-2652

Schlagwörter: Programming in abstract spaces, Banach spaces, Convex functions and convex programs in convex geometry, Fréchet differentiability, Nonsmooth analysis, subdifferential, Fréchet and Gateaux differentiability in optimization, Set-valued and variational analysis, Convexity of real functions of several variables, generalizations, Asplund theorem

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1982008
https://doi.org/10.1023/a:1023296417861
https://rd.springer.com/article/10.1023/a:1023296417861
https://link.springer.com/article/10.1023%2FA%3A1023296417861

on an augmented lagrangian sqp method for a class of optimal control problems in banach spaces: On an augmented Lagrangian SQP method for a class of optimal control problems in Banach spaces

Autoren: Nadir Arada Fredi Tröltzsch Jean-Pierre Raymond

Quelle: Computational Optimization and Applications. 22(3):369-398

Schlagwörter: Methods of successive quadratic programming type, Programming in abstract spaces, augmented Lagrangian SQP method in Banach spaces, optimal control, two-norm discrepancy, Numerical methods based on nonlinear programming, generalized Newton method, generalized equation, semilinear parabolic equation, Methods of quasi-Newton type, control constraints

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1930242
https://doi.org/10.1023/a:1019763022415
https://link.springer.com/article/10.1023%2FA%3A1019763022415
https://doi.org/10.1023/A:1019763022415

subdifferentiability and the duality gap: Subdifferentiability and the duality gap

Autoren: Neil E. Gretsky William R. Zame Joseph M. Ostroy

Quelle: Positivity. 6(3):261-274

Schlagwörter: Programming in abstract spaces, value function, Applications of functional analysis in optimization, convex analysis, mathematical programming, economics, subdifferentiability, duality gap, assignment model

Dateibeschreibung: application/xml

Zugangs-URL: http://www.econ.ucla.edu/zame/goz3.pdf
https://link.springer.com/article/10.1023%2FA%3A1020249022047

extension of subgradient techniques for nonsmooth optimization in banach spaces: Extension of subgradient techniques for nonsmooth optimization in Banach spaces

Autoren: Ya. I. Alber Alfredo N. Iusem

Quelle: Set-valued Analysis. 9(4):315-335

Schlagwörter: Programming in abstract spaces, Convex programming, subgradient method, nonsmooth convex functional, subgradient, duality mapping, generalized projection, \(J\)-Lipschitz continuous functional, weak convergence, estimates of convergence rate, Applications of functional analysis in optimization, convex analysis, mathematical programming, economics

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/article/10.1023%2FA%3A1012665832688

numerical gradients for shape optimization based on embedding domain techniques: Numerical gradients for shape optimization based on embedding domain techniques

Autoren: Karl Kunisch Gunther H. Peichl

Quelle: Computational Optimization and Applications. 18(2):95-114

Schlagwörter: Programming in abstract spaces, saddle point problems, gradient representation, shape optimization, embedding domain methods

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/article/10.1023/A%3A1008779803348

convergence properties of feasible descent methods for solving variational inequalities in banach spaces: Convergence properties of feasible descent methods for solving variational inequalities in Banach spaces

Autoren: Dao Li Zhu Patrice Marcotte

Quelle: Computational Optimization and Applications. 10(1):35-49

Schlagwörter: Programming in abstract spaces, global convergence, Banach spaces, Frank-Wolfe algorithm, projection, Variational inequalities, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), variational inequalities, feasible descent methods

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1139629
https://doi.org/10.1023/a:1018387816972
https://dblp.uni-trier.de/db/journals/coap/coap10.html#ZhuM98
https://trid.trb.org/view/523061
http://www.iro.umontreal.ca/~marcotte/ARTIPS/1998_COA.pdf
https://link.springer.com/article/10.1023/A%3A1018387816972

Characterization of Stability for Cone Increasing Constraint Mappings: Characterization of stability for cone increasing constraint mappings

Autoren: René Henrion

Quelle: Set-Valued Analysis. 5:323-349

Schlagwörter: Programming in abstract spaces, nonsmooth analysis, Nonsmooth analysis, 0211 other engineering and technologies, Stochastic programming, chance constraints, 02 engineering and technology, 01 natural sciences, Nonlinear programming, Sensitivity, stability, parametric optimization, 0101 mathematics, cone increasing constraints, metric regularity, genericity

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1145869
https://doi.org/10.1023/a:1008629709451
https://edoc.hu-berlin.de/handle/18452/3200
http://www.wias-berlin.de/people/henrion/coneinc.pdf
https://link.springer.com/article/10.1023/A%3A1008629709451

optimization and stability results through cone lower semicontinuity: Optimization and stability results through cone lower semicontinuity

Autoren: F. Ferro

Quelle: Set-valued Analysis. 5(4):365-375

Schlagwörter: Programming in abstract spaces, vector optimization, Methods involving semicontinuity and convergence, relaxation, Sensitivity, stability, parametric optimization, set-valued mappings, stability, Multi-objective and goal programming

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1145871
https://doi.org/10.1023/a:1008653120360
https://link.springer.com/article/10.1023/A%3A1008653120360

nonconvex problems of global optimization linear quadratic control problems with quadratic constraints: Nonconvex problems of global optimization: Linear-quadratic control problems with quadratic constraints

Autoren: V. A. Yakubovich Alexey S. Matveev

Quelle: Dynamics and Control. 7(2):99-134

Schlagwörter: Programming in abstract spaces, linear-quadratic control, Linear-quadratic optimal control problems, global constrained optimization problems, nonconvex problems, Optimality conditions for problems involving ordinary differential equations

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/991171
https://doi.org/10.1023/a:1008236815189
https://pureportal.spbu.ru/ru/publications/nonconvex-problems-of-global-optimization-linear-quadratic-contro
https://link.springer.com/article/10.1023/A%3A1008236815189

an extremal problem in a hilbert space: An extremal problem in a Hilbert space

Autoren: Vyacheslav Maksimov

Quelle: Differential Equations. 37(1):141-143

Schlagwörter: Programming in abstract spaces, Other numerical methods in calculus of variations, Hilbert space, Applications of operator theory in optimization, convex analysis, mathematical programming, economics, variational inequality, Variational inequalities, extremal problem

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/article/10.1023/A%3A1019288803057

CONE MAXIMAL POINTS IN COMPACT SUBSETS OF TOPOLOGICAL VECTOR SPACES: Cone maximal points in compact subsets of topological vector spaces

Autoren: TURINICI, Mihai

Quelle: Volume: 53, Issue: 0 13-28
İstanbul University Science Faculty The Journal Of Mathematics Physics and Astronomy
İstanbul University Science Faculty the Journal of Mathematics Physics and Astronomy

Schlagwörter: Programming in abstract spaces, Applications of functional analysis in optimization, convex analysis, mathematical programming, economics, 0211 other engineering and technologies, 02 engineering and technology, 01 natural sciences, convex cone, Zorn's lemma, Bourbaki fixed point principle, transfinite constructions, maximization on compact sets, Existence theories for problems in abstract spaces, 0101 mathematics, Compactness in topological linear spaces, angelic spaces, etc, Ordered topological linear spaces, vector lattices

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://zbmath.org/1046431
https://dergipark.org.tr/tr/pub/iusfjm/issue/9453/118370

Equilibrium programming in Hilbert spaces

Autoren: Combettes, Patrick Louis Hirstoaga, Sever Adrian Ruprecht, Liliane

Weitere Verfasser: Combettes, Patrick Louis Hirstoaga, Sever Adrian Ruprecht, Liliane

Schlagwörter: Programming in abstract spaces, [MATH.MATH-NA] Mathematics [math]/Numerical Analysis [math.NA], Optimality conditions for problems in abstract spaces, Minimax problems in mathematical programming

Dateibeschreibung: application/xml

Zugangs-URL: https://hal.science/hal-00017823v1
https://zbmath.org/2182576

OPTIMALITY CONDITIONS FOR SEMI-PREINVEX PROGRAMMING: Optimality conditions for semi-preinvex programming

Autoren: Lai, Hang-Chin

Quelle: Taiwanese J. Math. 1, no. 4 (1997), 389-404

Schlagwörter: Programming in abstract spaces, Convex programming, semi-connected set, semi-preinvex map, ordered vector spaces, 49A50, Variational inequalities, 01 natural sciences, 90C25, Convexity of real functions in one variable, generalizations, 90C48, semi-prevariational inequality, 26A51, 0101 mathematics, arc-directional differentiable map, semi-preinvex programming

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://projecteuclid.org/euclid.twjm/1500406118
http://projecteuclid.org/euclid.twjm/1500406118

Non convex optimization problems on weakly compact subsets of Banach spaces

Autoren: Cobzas, S.

Schlagwörter: Programming in abstract spaces, Normed linear spaces and Banach spaces, Banach lattices, upper semicontinuous functional, Methods involving semicontinuity and convergence, relaxation, nonconvex optimization, dense existence of solutions, Existence theories for problems in abstract spaces, Existence theories for optimal control problems involving partial differential equations, optimization problems in Banach spaces

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/3714439