Publication date: 19.12.2012
Licence: None
Editorial team
Editor-in-Chief Stanisław Migórski
Deputy Editor-in-Chief Adam Roman
Schedae Informaticae, Volume 21, 2012, pp. 9 - 26
https://doi.org/10.4467/20838476SI.12.001.0811Schedae Informaticae, Volume 21, 2012, pp. 27 - 40
https://doi.org/10.4467/20838476SI.12.002.0812Schedae Informaticae, Volume 21, 2012, pp. 41 - 54
https://doi.org/10.4467/20838476SI.12.003.0813Schedae Informaticae, Volume 21, 2012, pp. 55 - 63
https://doi.org/10.4467/20838476SI.12.004.0814Schedae Informaticae, Volume 21, 2012, pp. 65 - 79
https://doi.org/10.4467/20838476SI.12.005.0815Schedae Informaticae, Volume 21, 2012, pp. 81 - 105
https://doi.org/10.4467/20838476SI.12.006.0816Schedae Informaticae, Volume 21, 2012, pp. 107 - 125
https://doi.org/10.4467/20838476SI.12.007.0817Schedae Informaticae, Volume 21, 2012, pp. 127 - 139
https://doi.org/10.4467/20838476SI.12.008.0818Schedae Informaticae, Volume 21, 2012, pp. 141 - 157
https://doi.org/10.4467/20838476SI.12.009.0819Schedae Informaticae, Volume 21, 2012, pp. 159 - 168
https://doi.org/10.4467/20838476SI.12.010.0820Schedae Informaticae, Volume 21, 2012, pp. 169 - 175
https://doi.org/10.4467/20838476SI.12.011.0821Słowa kluczowe: Optimal boundary control, mesh-independence principle, weakly nonlinear elliptic equations, penalty methods for control constraints., Palais-Smale condition, noncoercive functional, second deformation theorem, p(x)-Laplacian, Palais-Smale condition, mountain pass theorem, variable exponent Sobolev space, true convexity, differentiable characterization, full dimensional convex set., convexity, strict convexity, strong convexity, bilevel programming, value function reformulation, KKT reformulation, constraint qualifications, optimality conditions, optimal control, penalty barrier methods, control constraints, coupled parabolic system, discretization, Nonsmooth Optimization, Generalized Convexity, minimum circumscribed, maximum inscribed, minimum zone, geometrical form elements, coordinate measuring, mini-max problem, steepest descent, nonlinear optimization, p-factor operator, p-regularity, kernel, singularity, convergence, necessary and sucient conditions, Carathéodory function, Dirichlet problem, p-Laplacian, three critical points theorem, weak solution, automatic differentiation, optimization, lens design