• Home
  • Search
  • Accelerated Directional Search with Non-Euclidean Prox-Structure
  • Cite Icon7
  • https://doi.org/10.1134/s0005117919040076Copy DOI Icon

Accelerated Directional Search with Non-Euclidean Prox-Structure

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In the paper we propose an accelerated directional search method with non-euclidian prox-structure. We consider convex unconstraint optimization problem in $\mathbb{R}^n$. For simplicity we start from the zero point. We expect in advance that 1-norm of the solution is close enough to its 2-norm. In this case the standard accelerated Nesterov's directional search method can be improved. In the paper we show how to make Nesterov's method $n$-times faster (up to a $\log n$-factor) in this case. The basic idea is to use linear coupling, proposed by Allen-Zhu & Orecchia in 2014, and to make Grad-step in 2-norm, but Mirr-step in 1-norm. We show that for constrained optimization problems this approach stable upon an obstacle.

Similar Papers
  • Conference Article
  • Citations11

Antenna Array Synthesis Using Derivative, Non-Derivative and Random Search Optimization

  • Apr 01, 2008
  • Stephen J Blank +1
  • Book Chapter
  • Citations1

Chapter 10 - Numerical Methods for Unconstrained Optimum Design

  • Apr 08, 2016
  • Introduction to Optimum Design
  • Jasbir S Arora
  • Research Article
  • Citations6

The numerical computation of kinetic parameters for contracting interface reactions

  • Jun 01, 1976
  • Journal of Thermal Analysis
  • A C Norris +2
  • Conference Article
  • Citations2

Mixed Discrete and Continuous Variable Optimization Based on Constraint Aggregation and Relative Sensitivity

  • Aug 04, 2013
  • Zhansi Jiang +2
  • Research Article
  • Citations7

Pareto 최적점 기반 다목적함수 기법 개발에 관한 연구

  • Apr 01, 2005
  • Journal of the Society of Naval Architects of Korea
  • Seung-Soo Na
  • Research Article
  • Citations25

A hybrid shuffled complex evolution approach with pattern search for unconstrained optimization

  • Mar 21, 2011
  • Mathematics and Computers in Simulation
  • Viviana Cocco Mariani +1
  • Research Article
  • Citations8

Direct search methods for the fast optimisation of batch distillation processes

  • Oct 22, 2022
  • Separation and Purification Technology
  • Laszlo Hegely
  • Research Article

Optimization of Doubly Fed Induction Generator Equivalent Circuit Parameters by Direct Search Method

  • Apr 04, 2017
  • Zenodo (CERN European Organization for Nuclear Research)
  • Mamidi Ramakrishna Rao
  • Research Article
  • Citations19

Robust and efficient nonlinear regression of kinetic systems using a direct search method

  • Feb 01, 1991
  • Computers and Chemical Engineering
  • L.S Lobo +1
  • Research Article
  • Citations52

Iterated local search with Powell’s method: a memetic algorithm for continuous global optimization

  • Feb 24, 2010
  • Memetic Computing
  • Oliver Kramer
  • Research Article
  • Citations54

Thermal design improvement of a double-layered microchannel heat sink by using multi-walled carbon nanotube (MWCNT) nanofluids with non-Newtonian viscosity

  • Oct 19, 2018
  • Applied Thermal Engineering
  • A Sarlak +2
  • Conference Article
  • Citations1

Artificial neural network controller for multi-link structures

  • Jan 05, 1995
  • D.L Styer +1
  • Research Article
  • Citations31

Design of prestressed concrete flat slab using modern heuristic optimization techniques

  • Nov 30, 2011
  • Expert Systems with Applications
  • M El Semelawy +2
  • Research Article
  • Citations166

A hybrid multi-agent based particle swarm optimization algorithm for economic power dispatch

  • Jul 10, 2010
  • International Journal of Electrical Power & Energy Systems
  • Rajesh Kumar +2
  • Research Article
  • Citations15

Gradient flows and proximal splitting methods: A unified view on accelerated and stochastic optimization.

  • May 10, 2021
  • Physical Review E
  • Guilherme França +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.