Papers by ERIK ALEX PAPA QUIROZ
Lecture notes in networks and systems, Aug 17, 2022
Pesquimat
Se introduce un algoritmo de punto proximal inexacto utilizando cuasi-distancias para dar solució... more Se introduce un algoritmo de punto proximal inexacto utilizando cuasi-distancias para dar solución a un problema de minimización en el espacio Euclideano. Este algoritmo ha sido motivado por el método proximal introducido por Attouch et al. [1] pero en este caso consideramos cuasi-distancias en vez de la distancia Euclidiana, funciones que satisfacen la desigualdad de Kurdyka-Lojasiewicz, errores vectoriales en el residual del punto crítico de los subproblemas proximales regula-rizados. Obtenemos bajo algunos supuestos adicionales la convergencia global de la sucesión generada por el algoritmo a un punto crítico del problema.
Universidad Privada del Norte eBooks, Mar 9, 2021
There are several technological solutions currently available in the market that allow customers/... more There are several technological solutions currently available in the market that allow customers/citizens to digitally sign electronic documents through their smartphones. Regardless of how user-friendly they are, most of these platforms use proprietary schemes designed for particular use cases, which could not necessarily be applied to open, interoperable scenarios and where there could be legal consequences. To establish a general framework that may provide manufacturers with minimum safety, reliability, and legal requirements, several international organizations have proposed standards for both manufacturers and potential users. Within this context, this paper presents, for the first time in Peru, a list of security, privacy, and interoperability requirements for remote digital signature for the Peruvian state. This research was based on features of the current state of the art, the existing international standards and the current state of the technology. The relevance and viability of these requirements were validated by RENIEC (Spanish acronym of National Registry of Identification and Civil Status) specialist personnel through an inter institutional cooperation agreement between RENIEC and PNICP (Spanish acronym of National Program of Innovation for the Competitivity and Productivity).
2020 IEEE Engineering International Research Conference (EIRCON), 2020
This paper presents a review of the adoption of elliptic curve cryptography (ECC) algorithms in X... more This paper presents a review of the adoption of elliptic curve cryptography (ECC) algorithms in X.509 digital certificates. It was analyzed the cases of Estonia, United Arab Emirates (UAE), Australia, Brazil, and Egypt. Although all five countries have considered using ECC algorithms, only two (Estonia and UAE) use them throughout their entire PKI hierarchy (root, intermediates, and end-entity certificates). Our findings complement those of Bos et al. [1], which in 2014 identified only Austria as an adopter of ECC in end-entity X.509 digital certificates for electronic signatures.
Modelling, Computation and Optimization in Information Systems and Management Sciences, 2021
Emerging Research in Intelligent Systems, 2022
2020 IEEE Engineering International Research Conference (EIRCON), 2020
This paper aims to identify the current state of the art of the latest research related to suppor... more This paper aims to identify the current state of the art of the latest research related to support vector machines through a literature review system according to the methodology proposed by Kitchenham and Charter, in order to answer the following research questions: Q1: In which research areas are they used? Q2: What are the main applications related with classification? Q3: What optimization methods or algorithms are used in SVMs?
2021 IEEE Sciences and Humanities International Research Conference (SHIRCON), 2021
This article aims to identify the current state of the art of the latest research related to mode... more This article aims to identify the current state of the art of the latest research related to models and algorithms in support vector machines for regression. For that, we use the methodology proposed by Kitchenham and Charter, in order to answer the following research questions: Q1: In which research areas is the support vector machine for regression most used? Q2. What optimization models are used to support vector machine for regression? Q3. What algorithms or optimization methods are used to solve support vector machine for regression? Q4. What nonconvex optimization models use support vector machine for regression? Q5. What optimization algorithms are used for nonconvex models to support vector machine for regression? We obtain valuable information about the questions to construct new models and algorithms in this research area.
Proceedings of the 2020 3rd International Conference on Robot Systems and Applications, 2020
In this paper we propose an inexact proximal point method to solve multiobjective minimization pr... more In this paper we propose an inexact proximal point method to solve multiobjective minimization problems with locally Lipschitz quasiconvex objective functions on the nonnegative orthant. Assuming that the function is also bounded from below, lower semicontinuous and using proximal distances, we obtain the convergence of the sequences generated by the algorithm. We give some computational results and an application to demand theory is presented.
Proceedings of the 2020 5th International Conference on Multimedia Systems and Signal Processing, 2020
The location problem is of great interest in order to establish different location demands in the... more The location problem is of great interest in order to establish different location demands in the state or private sector. The model of this problem is usually reduced to a mathematical optimization problem. In this paper we present a proximal method to solve location problems where the objective function is quasi-convex and non-differentiable. We prove that the iterations given by the method are well defined and under some assumptions on the objective function we prove the convergence of the method.
ABSTRACT It is proposed the development of a forecast model capable of predicting the behavior of... more ABSTRACT It is proposed the development of a forecast model capable of predicting the behavior of the price indices and quotes of the shares traded on the Lima Stock Exchange, based on the use of artificial intelligence techniques such as artificial neural networks and fuzzy logic based on computational optimization methods. The proposed model considers the forecast, in addition to the historical quantitative data of the share price, the inclusion of qualitative macroeconomic factors that significantly influence the behavior of the time series of the stock markets. It is about harnessing the ability of artificial neural networks to work with nonlinear quantitative data and their capacity for learning and also take advantage of the fuzzy logic technique to simulate the way of reasoning of human beings by defining judgment rules or knowledge base and their evaluation through inference mechanisms. The main contribution is to demonstrate that the proposed model is capable of obtaining more optimal approximations in the forecast of the financial time series
2021 IEEE Engineering International Research Conference (EIRCON), 2021
This paper aims to identify the current state of the art of the latest research related to Conjug... more This paper aims to identify the current state of the art of the latest research related to Conjugate Gradient (CG) methods for unconstrained optimization through a systematic literature review according to the methodology proposed by Kitchenham and Charter, to answer the following research questions: Q1: In what research areas are the conjugate gradient method used? Q2: Can Dai-Yuan conjugate gradient algorithm be effectively applied in portfolio selection? Q3: Have conjugate gradient methods been used to develop large-scale numerical results? Q4: What conjugate gradient methods have been used to minimize quasiconvex or nonconvex functions? We obtain useful results to extend the applications of the CG methods, develop efficient algorithms, and continue studying theoretical convergence results.
La Optimizacion es una linea de investigacion que tiene una gran importancia en diversas areas de... more La Optimizacion es una linea de investigacion que tiene una gran importancia en diversas areas de las ciencias y la ingenieria. Entre los metodos que forman parte de los distintos software para resolver modelos de optimizacion se encuentran los metodos proyectivos. Propiedades de convergencia de estos metodos son garantizados bajo algunas condiciones de convexidad. Una desventaja es el alto costo computacional en realizar en cada iteracion una proyeccion como tambien la incertidumbre cuando el problema pierde la convexidad. Una forma de evitar estas dificultades es usar herramientas de la geometria riemanniana. Una de las ventajas es que problemas restrictos pueden ser considerados como irrestrictos y funciones no convexas se pueden transformar en convexas. Este libro extiende las propiedades de convergencia del metodo del gradiente para minimizar funciones cuasi-convexas en estas variedades y asi ampliar el campo de aplicaciones del metodo. El material esta dirigido para investigad...
Proceedings of the 2020 5th International Conference on Multimedia Systems and Signal Processing, 2020
This work is devoted to the study of a proximal decomposition algorithm for solving convex symmet... more This work is devoted to the study of a proximal decomposition algorithm for solving convex symmetric cone optimization with separable structures. The algorithm considered is based on the decomposition method proposed by Chen and Teboulle (1994) and the proximal generalized distance defined by Auslender and Teboulle (2006). Under suitable assumptions, it is proven that each limit point of the primal-dual sequences generated by the algorithm solves the problem. Finally, the global convergence is established.
2020 IEEE XXVII International Conference on Electronics, Electrical Engineering and Computing (INTERCON), 2020
In this article, we present a list of 51 technical requirements for a new Peru’s national electro... more In this article, we present a list of 51 technical requirements for a new Peru’s national electronic identity (eID) card, grouped on four categories: general, card, hardware (subdivided into the antenna, chip, and memory), and software (subdivided into the operating system, applications, middleware, and complements). Their definition was based on features of the current eID card, the existing international standards, and the current state of technology. Their relevance was validated by RENIEC specialist personnel, and their usefulness was validated in practice, being the base of an international public tender for the acquisition of three million cards.
2021 IEEE XXVIII International Conference on Electronics, Electrical Engineering and Computing (INTERCON), 2021
In this paper we determine the elliptic curve algorithms with its respective parameters and techn... more In this paper we determine the elliptic curve algorithms with its respective parameters and technical specifications for a new PKI (Public Key Infrastructure) hierarchy in the Peruvian state considering the following aspects: the provisions of accreditation guide for Certification Entities of the IOFE, cryptographic modules of the hierarchy ECERNEP PERU CA ROOT 4, elliptic curves of the SafeCurves initiatives and elliptic curves utilized in Public Key Infrastructure (PKI) for digital signature and encryption. The results of this paper were validated by RENIEC (Spanish acronym of National Registry of Identification and Civil Status) specialist personnel and were used for the implementation of the new PKI hierarchy for the Peruvian state.
Journal of the Operations Research Society of China, 2020
We present an extension of the proximal point method with Bregman distances to solve Variational ... more We present an extension of the proximal point method with Bregman distances to solve Variational Inequality Problems (VIP) on Hadamard manifolds (simply connected finite dimensional Riemannian manifold with nonpositive sectional curvature). Under some natural assumption, as for example, the existence of solutions of the (VIP) and the monotonicity of the multivalued vector field, we prove that the sequence of the iterates given by the method converges to a solution of the problem.
Journal of Optimization Theory and Applications, 2020
In this paper, we present two inexact scalarization proximal point methods to solve quasiconvex m... more In this paper, we present two inexact scalarization proximal point methods to solve quasiconvex multiobjective minimization problems on Hadamard manifolds. Under standard assumptions on the problem, we prove that the two sequences generated by the algorithms converge to a Pareto critical point of the problem and, for the convex case, the sequences converge to a weak Pareto solution. Finally, we explore an application of the method to demand theory in economy, which can be dealt with using the proposed algorithm.
RAIRO - Operations Research, 2020
This paper presents an inexact proximal method for solving monotone variational inequality proble... more This paper presents an inexact proximal method for solving monotone variational inequality problems with a given separable structure. The proposed algorithm is a natural extension of the Proximal Multiplier Algorithm with Proximal Distances (PMAPD) proposed by Sarmiento et al. [Optimization 65 (2016) 501–537], which unified the works of Chen and Teboulle (PCPM method), and Kyono and Fukushima (NPCPMM) developed for solving convex programs with a particular separable structure. The resulting method combines the recent proximal distances theory introduced by Auslender and Teboulle [SIAM J. Optim. 16 (2006) 697–725] with a decomposition method given by Chen and Teboulle for convex problems and extends the results of the Entropic Proximal Decomposition Method proposed by Auslender and Teboulle, which used to Logarithmic Quadratic proximal distances. Under some mild assumptions on the problem we prove a global convergence of the primal–dual sequences produced by the algorithm.
Uploads
Papers by ERIK ALEX PAPA QUIROZ